Controlling Connectivity of Dynamic Graphs

The control of mobile networks of multiple agents raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In this paper, we consider the problem of controlling a network of agents so that the resulting motion always preserves various connectivity properties. In particular, we consider preserving k-hop connectivity, where agents are allowed to move while maintaining connections to agents that are no more than k-hops away. The connectivity constraint is translated to constrains on individual agent motion by considering the dynamics of the adjacency matrix and related constructs from algebraic graph theory. As special cases, we obtain motion constraints that can preserve the exact structure of the initial dynamic graph, or may simply preserve the usual notion connectivity while the structure of the graph changes over time. We conclude by illustrating various interesting problems that can be achieved while preserving connectivity constraints.

[1]  Alexander Graham,et al.  Kronecker Products and Matrix Calculus: With Applications , 1981 .

[2]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

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

[4]  Petter Ögren,et al.  A control Lyapunov function approach to multi-agent coordination , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[5]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[6]  Xiaoming Hu,et al.  A control Lyapunov function approach to multiagent coordination , 2002, IEEE Trans. Robotics Autom..

[7]  R. Murray,et al.  Agreement problems in networks with directed graphs and switching topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[8]  R. Murray,et al.  Consensus protocols for networks of dynamic agents , 2003, Proceedings of the 2003 American Control Conference, 2003..

[9]  Luc Moreau,et al.  Leaderless coordination via bidirectional and unidirectional time-dependent communication , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

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

[11]  Mehran Mesbahi,et al.  On state-dependent dynamic graphs and their controllability properties , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[12]  F. Bullo,et al.  Coordinated deployment of mobile sensing networks with limited-range interactions , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[13]  R. Murray,et al.  Robust connectivity of networked vehicles , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[14]  R. Beard,et al.  Consensus of information under dynamically changing interaction topologies , 2004, Proceedings of the 2004 American Control Conference.

[15]  F. Paganini,et al.  Convex synthesis of controllers for consensus , 2004, Proceedings of the 2004 American Control Conference.

[16]  Gerardo Lafferriere,et al.  Decentralized control of vehicle formations , 2005, Syst. Control. Lett..

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

[18]  George J. Pappas,et al.  Flocking in Fixed and Switching Networks , 2007, IEEE Transactions on Automatic Control.