Generalization of nonlinear cyclic pursuit

In this paper, some generalizations of the problem of formation of a group of autonomous mobile agents under nonlinear cyclic pursuit is studied. Cyclic pursuit is a simple distributed control law, in which the agent i pursues agent i+1 modulo n. Each agent is subjected to a nonholonomic constraint. A necessary condition for equilibrium formation to occur among a group of agents with different speeds and different controller gains is obtained. These results generalize equal speed and equal controller gain results available in the literature.

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

[2]  Mireille E. Broucke,et al.  Local control strategies for groups of mobile autonomous agents , 2004, IEEE Transactions on Automatic Control.

[3]  Alfred M. Bruckstein,et al.  Ants, Crickets and Frogs in Cyclic Pursuit , 1991 .

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

[5]  Tom J. Richardson,et al.  Non-mutual captures in cyclic pursuit , 2001, Annals of Mathematics and Artificial Intelligence.

[6]  Alfred M. Bruckstein,et al.  Why the ant trails look so straight and nice , 1993 .

[7]  D. Ghose,et al.  Generalization of the cyclic pursuit problem , 2005, Proceedings of the 2005, American Control Conference, 2005..

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

[9]  F. Behroozi,et al.  Cyclic pursuit in a plane , 1979 .

[10]  Debasish Ghose,et al.  Generalization of Linear Cyclic Pursuit With Application to Rendezvous of Multiple Autonomous Agents , 2006, IEEE Transactions on Automatic Control.

[11]  Donald J. Newman,et al.  Cyclic Pursuit or “the Three Bugs Problem” , 1971 .