Redundantly rigid topologies in decentralized multi-agent networks

In this paper, we consider the problem of decentralized evaluation of redundant rigidity of a multi-agent network topology. Redundancy is an important restriction of a graph's rigidity property as it is a necessary condition for the global rigidity of a graph, a combinatorial notion that is vital for graph realizability with consequences for example in localization. Furthermore, redundant rigidity enforces additional structure which allows for link loss or failure while maintaining an underlying rigid topology. First, we map the combinatorial conditions for determining redundant rigidity to the context of a centralized pebble game. By exploiting intuition from a bipartite matching characterization, we demonstrate decentralized conditions based in graph search and agent agreement. Then we provide a complete description of a decentralized algorithm for evaluating redundant rigidity, exploiting auctions and boolean consensus. To illustrate our methods, we provide a brief simulation study of redundant rigidity evaluation and nonholonomic control that closes the paper.

[1]  G. Laman On graphs and rigidity of plane skeletal structures , 1970 .

[2]  B. Roth,et al.  The rigidity of graphs, II , 1979 .

[3]  D. Bertsekas The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

[4]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[5]  D. West Introduction to Graph Theory , 1995 .

[6]  B. Hendrickson,et al.  Regular ArticleAn Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game , 1997 .

[7]  B. Hendrickson,et al.  An Algorithm for Two-Dimensional Rigidity Percolation , 1997 .

[8]  Tibor Jordán,et al.  Algorithms for Graph Rigidity and Scene Analysis , 2003, ESA.

[9]  Robert Connelly,et al.  Generic Global Rigidity , 2005, Discret. Comput. Geom..

[10]  Harold N. Gabow,et al.  Forests, frames, and games: Algorithms for matroid sums and applications , 1992, STOC '88.

[11]  Brian D. O. Anderson,et al.  A Theory of Network Localization , 2006, IEEE Transactions on Mobile Computing.

[12]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[13]  J. Hendrickx,et al.  Rigid graph control architectures for autonomous formations , 2008, IEEE Control Systems.

[14]  Jianghai Hu,et al.  Stiffness matrix and quantitative measure of formation rigidity , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[15]  Moe Z. Win,et al.  Cooperative Localization in Wireless Networks , 2009, Proceedings of the IEEE.

[16]  Mireille E. Broucke,et al.  Stabilisation of infinitesimally rigid formations of multi-robot networks , 2009, Int. J. Control.

[17]  B. Anderson,et al.  Development of redundant rigidity theory for formation control , 2009 .

[18]  B. Roth Rigid and Flexible Frameworks , 1981 .

[19]  Gaurav S. Sukhatme,et al.  Constrained Interaction and Coordination in Proximity-Limited Multiagent Systems , 2013, IEEE Transactions on Robotics.

[20]  Gaurav S. Sukhatme,et al.  Evaluating Network Rigidity in Realistic Systems: Decentralization, Asynchronicity, and Parallelization , 2014, IEEE Transactions on Robotics.

[21]  Antonio Franchi,et al.  Decentralized rigidity maintenance control with range measurements for multi-robot systems , 2013, Int. J. Robotics Res..

[22]  Gaurav S. Sukhatme,et al.  Decentralized and Parallel Constructionsfor Optimally Rigid Graphs in $\mathbb{R}^2$ , 2015, IEEE Trans. Mob. Comput..

[23]  Gaurav S. Sukhatme,et al.  Global connectivity control for spatially interacting multi-robot systems with unicycle kinematics , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[24]  Ryan K. Williams,et al.  Decentralized and Parallel Constructions for Optimally Rigid Graphs in R 2 , 2015 .

[25]  Tolga Eren,et al.  Graph invariants for unique localizability in cooperative localization of wireless sensor networks: Rigidity index and redundancy index , 2015, Ad Hoc Networks.