Abstract
In a companion paper [5] we resolved the question of whether cyclic pursuits can exhibit ‘non-mutual’ captures. Although, as we showed, non-mutual captures can occur, the set of initial conditions which lead to them has Lebesgue measure zero. Thus, generically, cyclic pursuits collapse into a mutual capture. In this paper we consider whether the pursuit configuration can asymptotically approach a regular one for a non-trivial set of initial conditions. More precisely, we study the stability of regular geometries of cyclic pursuit. We show that in all dimensions the only stable regular n-bug shapes are the regular two dimensional n-gons, n≥7, in which each vertex chases its neighboring vertex in some fixed orientation. We also analize the three bug cyclic pursuit in detail, proving that, except for the equilateral initial position, the triangle formed is asymptotically degenerate with the minimum interior angle tending to zero while the vertex at which the minimum is located rotates among the vertices infinitely often.
Similar content being viewed by others
References
V. Arnold, Ordinary Differential Equations (MIT Press, 1981).
F. Behroozi and R. Gagnon, Perimeter expansion in the n-bug system and its relationship to stability, J. Math. Phys. 22 (April 1981) 656-662.
M.S. Klamkin and D.J. Newman, Cyclic pursuit or “the Three Bugs problem”, Amer. Math. Monthly (June 1971) 631-639.
B.C. Kuo, Automatic Control Systems (Prentice-Hall, Englewood Cliffs, NJ, 1982).
T.J. Richardson, Non-mutual captures in cyclic pursuit, this issue.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Richardson, T. Stable polygons of cyclic pursuit. Annals of Mathematics and Artificial Intelligence 31, 147–172 (2001). https://doi.org/10.1023/A:1016678406688
Issue Date:
DOI: https://doi.org/10.1023/A:1016678406688