Apollonius-boundary conjecture for active pursuers in the MPSE problem

From papers

Let an MPSE problem have pursuers and evaders at positions at time tt, with 0t<tc0\leq t<t_c. Let Bt\mathcal{B}^t be the Apollonius boundary and let Ai\mathcal{A}_i denote the Apollonius circle associated with pursuer PiP_i. Assume that the pursuers follow a constant bearing strategy. Apollonius-boundary conjecture. Pursuer PiP_i is active at time tt if

BtAi,\mathcal{B}^t\cap\mathcal{A}_i\neq\varnothing,

and is redundant otherwise. The conjecture provides the criterion used by the proposed algorithm to identify active and redundant pursuers in a multiple-pursuer, single-evader problem; the supplied text gives no evidence that it has been proved or disproved.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Venkata Ramana Makkapati and Panagiotis Tsiotras, “Apollonius Allocation Algorithm for Heterogeneous Pursuers to Capture Multiple Evaders”, arXiv:2006.10253 (2020).

Solutions 0

No solutions have been posted yet.