Dependent reachable sets for the constant bearing pursuit strategy

This paper introduces a novel reachability problem for the scenario involving two agents, where one agent follows another agent using a feedback strategy. The geometry of the reachable set for an agent, termed dependent reachable set, is characterised using the constant bearing pursuit strategy as a case study. Key theoretical results are presented that provide geometric bounds for the associated dependent reachable set. Simulation results are presented to empirically establish the shape of the dependent reachable set. In the process, an original optimisation problem is formulated and analysed for the constant bearing pursuit strategy.