Collision-Free Formation Control with Decentralized Connectivity Preservation for Nonholonomic-Wheeled Mobile Robots

The preservation of connectivity in mobile robot networks is critical to the success of most existing algorithms designed to achieve various goals. The most basic method to preserve connectivity is to have each agent preserve its set of neighbors for all time. More advanced methods preserve a (minimum) spanning tree in the network. Other methods are based on increasing the algebraic graph connectivity, which is given by the second smallest eigenvalue λ2(L) of the graph Laplacian λ2(L) that represents the network. These methods typically result in a monotonic increase in connectivity until the network is completely connected. In previous work by the authors, a continuous feedback control method had been proposed which allows the connectivity to decrease, that is, edges in the network may be broken. This method requires agents to have knowledge of the entire network. In this paper, we modify the controller to use only local information. The connectivity controller is based on maximization of λ2(L) and artificial potential functions and can be used in conjunction with artificial potential-based formation controllers. The controllers are extended for implementation on nonholonomic-wheeled mobile robots, and the performance is demonstrated in an experiment on a team of wheeled mobile robots.

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

[2]  Dusan M. Stipanovic,et al.  Remote Formation Control and Collision Avoidance for Multi-Agent Nonholonomic Systems , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[3]  George J. Pappas,et al.  Controlling Connectivity of Dynamic Graphs , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[4]  Siddhartha S. Srinivasa,et al.  Decentralized estimation and control of graph connectivity in mobile sensor networks , 2008, ACC.

[5]  Karl Henrik Johansson,et al.  Bounded control of network connectivity in multi-agent systems , 2010 .

[6]  Siddhartha S. Srinivasa,et al.  Decentralized estimation and control of graph connectivity in mobile sensor networks , 2008, 2008 American Control Conference.

[7]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[8]  Warren E. Dixon,et al.  Network Connectivity Preserving Formation Stabilization and Obstacle Avoidance via a Decentralized Controller , 2012, IEEE Transactions on Automatic Control.

[9]  Magnus Egerstedt,et al.  Distributed Coordination Control of Multiagent Systems While Preserving Connectedness , 2007, IEEE Transactions on Robotics.

[10]  Amir G. Aghdam,et al.  A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems , 2010, IEEE Transactions on Automatic Control.

[11]  George J. Pappas,et al.  Distributed connectivity control of mobile networks , 2007, 2007 46th IEEE Conference on Decision and Control.

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

[13]  Panos J. Antsaklis,et al.  Formation control of multi-agent systems with connectivity preservation by using both event-driven and time-driven communication , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[14]  Mehran Mesbahi,et al.  On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian , 2006, IEEE Transactions on Automatic Control.

[15]  Mark W. Spong,et al.  Connectivity preserving formation control with collision avoidance for nonholonomic wheeled mobile robots , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.