Cyclic Evasion in the Three Bug Problem

Abstract In this note, we present a simple proof that three bugs involved in cyclic evasion converge to an equilateral triangle configuration. The approach relies on an energy-type estimate that makes use of a new inequality for the triangle.

[1]  D. J. H. Garling,et al.  The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities by J. Michael Steele , 2005, Am. Math. Mon..

[2]  Murray S. Klamkin,et al.  Cyclic Pursuit or "The Three Bugs Problems" , 1971 .

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

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

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

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

[7]  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.

[8]  Daniel Liberzon,et al.  Cyclic pursuit without coordinates: Convergence to regular polygon formations , 2014, 53rd IEEE Conference on Decision and Control.

[9]  L. Trefethen,et al.  Four bugs on a rectangle , 2011, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.