A non-communicating multi-robot system with switchable formations

We consider connected navigation of autonomous mobile robots with transitions in the group formation. The robots navigate using simple local steering rules without requiring explicit communication among themselves. The formations are achieved by designing proper cost functions and formation transitions are succeeded by switching among these cost functions. The resulting system is proven to be deadlock-free under certain conditions.

[1]  Debasish Ghose,et al.  Formations of minimalist mobile robots using local-templates and spatially distributed interactions , 2005, Robotics Auton. Syst..

[2]  José Maria Giron-Sierra,et al.  Robot Navigation Based on Discrimination of Artificial Fields: Application to Robot Formations , 2012, Adv. Robotics.

[3]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[4]  Magnus Egerstedt,et al.  Graph-theoretic connectivity control of mobile robot networks , 2011, Proceedings of the IEEE.

[5]  Vijay Kumar,et al.  Modeling and control of formations of nonholonomic mobile robots , 2001, IEEE Trans. Robotics Autom..

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

[7]  Norman Biggs Algebraic Graph Theory: Index , 1974 .

[8]  F. Kerestecioglu,et al.  Connected navigation of non-communicating mobile agents , 2012, Proceedings of 2012 UKACC International Conference on Control.

[9]  Ahmet Cezayirli,et al.  Navigation of non-communicating autonomous mobile robots with guaranteed connectivity , 2013, Robotica.

[10]  George J. Pappas,et al.  Potential Fields for Maintaining Connectivity of Mobile Networks , 2007, IEEE Transactions on Robotics.

[11]  Ali Jadbabaie,et al.  Decentralized Control of Connectivity for Multi-Agent Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[12]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[13]  Vijay Kumar,et al.  Closed loop motion planning of cooperating mobile robots using graph connectivity , 2008, Robotics Auton. Syst..

[14]  Vincenzo Gervasi,et al.  Coordination without communication: the case of the flocking problem , 2004, Discret. Appl. Math..