Cyclic pursuit without coordinates: Convergence to regular polygon formations

We study a multi-agent cyclic pursuit model where each of the identical agents moves like a Dubins car and maintains a fixed heading angle with respect to the next agent. We establish that stationary shapes for this system are regular polygons. We derive a sufficient condition for local convergence to such regular polygon formations, which takes the form of an inequality connecting the angles of the regular polygon with the heading angle of the agents. A block-circulant structure of the system's linearization matrix in suitable coordinates facilitates and elucidates our analysis. Our results are complementary to the conditions for rendezvous obtained in earlier work [Yu et al., IEEE Trans. Autom. Contr., Feb. 2012].

[1]  E. Frank.  On the zeros of polynomials with complex coefficients , 1946 .

[2]  Kevin S. Galloway,et al.  Symmetry and reduction in collectives: cyclic pursuit strategies , 2013, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[3]  Daniel Liberzon,et al.  Rendezvous without coordinates , 2008, 2008 47th IEEE Conference on Decision and Control.

[4]  Emilio Frazzoli,et al.  Decentralized Policies for Geometric Pattern Formation and Path Coverage , 2007 .

[5]  Feredoon Behroozi,et al.  Perimeter expansion in the n‐bug system and its relationship to stability , 1981 .

[6]  Mireille E. Broucke,et al.  Pursuit formations of unicycles , 2006, Autom..

[7]  Tom J. Richardson,et al.  Stable polygons of cyclic pursuit , 2001, Annals of Mathematics and Artificial Intelligence.

[8]  Manish Kumar,et al.  Cyclic pursuit in a multi-agent robotic system with double-integrator dynamics under linear interactions , 2013, Robotica.

[9]  Mireille E. Broucke,et al.  Formations of vehicles in cyclic pursuit , 2004, IEEE Transactions on Automatic Control.

[10]  Debasish Ghose,et al.  Generalization of nonlinear cyclic pursuit , 2007, Autom..