Evaluating Network Rigidity in Realistic Systems: Decentralization, Asynchronicity, and Parallelization

In this paper, we consider the problem of evaluating the rigidity of a planar network, while satisfying common objectives of real-world systems: decentralization, asynchronicity, and parallelization. The implications that rigidity has in fundamental multirobot problems, e.g., guaranteed formation stability and relative localizability, motivates this study. We propose the decentralization of the pebble game algorithm of Jacobs et al. , which is an O(n2) method that determines the generic rigidity of a planar network. Our decentralization is based on asynchronous messaging and distributed memory, coupled with auctions for electing leaders to arbitrate rigidity evaluation. Further, we provide a parallelization that takes inspiration from gossip algorithms to yield significantly reduced execution time and messaging. An analysis of the correctness, finite termination, and complexity is given, along with a simulated application in decentralized rigidity control. Finally, we provide Monte Carlo analysis in a Contiki networking environment, illustrating the real-world applicability of our methods, and yielding a bridge between rigidity theory and realistic interacting systems.

[1]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[2]  M. Ani Hsieh,et al.  Robotic manifold tracking of coherent structures in flows , 2012, 2012 IEEE International Conference on Robotics and Automation.

[3]  H. Gluck.  Almost all simply connected closed surfaces are rigid , 1975 .

[4]  Baris Fidan,et al.  Edge contraction based maintenance of rigidity in multi-agent formations during agent loss , 2009, 2009 17th Mediterranean Conference on Control and Automation.

[5]  Angelia Nedic,et al.  Asynchronous Broadcast-Based Convex Optimization Over a Network , 2011, IEEE Transactions on Automatic Control.

[6]  Soummya Kar,et al.  Gossip Algorithms for Distributed Signal Processing , 2010, Proceedings of the IEEE.

[7]  Brian D. O. Anderson,et al.  Stabilization of rigid formations with direction-only constraints , 2011, IEEE Conference on Decision and Control and European Control Conference.

[8]  Naomi Ehrich Leonard,et al.  Collective Motion, Sensor Networks, and Ocean Sampling , 2007, Proceedings of the IEEE.

[9]  Mehran Mesbahi,et al.  Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks , 2011, IEEE Transactions on Automatic Control.

[10]  Gaurav S. Sukhatme,et al.  Decentralized generic rigidity evaluation in interconnected systems , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[12]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[13]  Gaurav S. Sukhatme,et al.  Distributed combinatorial rigidity control in multi-agent networks , 2013, 52nd IEEE Conference on Decision and Control.

[14]  Tolga Eren,et al.  Formation shape control based on bearing rigidity , 2012, Int. J. Control.

[15]  Antonio Franchi,et al.  Rigidity Maintenance Control for Multi-Robot Systems , 2012, Robotics: Science and Systems.

[16]  B. Roth,et al.  The rigidity of graphs , 1978 .

[17]  F. Bullo,et al.  Motion Coordination with Distributed Information , 2007 .

[18]  W. Whiteley,et al.  Generating Isostatic Frameworks , 1985 .

[19]  L. Lovász,et al.  On Generic Rigidity in the Plane , 1982 .

[20]  R. Murray,et al.  Graph rigidity and distributed formation stabilization of multi-vehicle systems , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

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

[22]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[23]  Yu-Yan Zhang,et al.  Automatic generation of optimally rigid formations using decentralized methods , 2010, Int. J. Autom. Comput..

[24]  Gaurav S. Sukhatme,et al.  Topology-constrained flocking in locally interacting mobile networks , 2013, 2013 IEEE International Conference on Robotics and Automation.

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

[26]  George J. Pappas,et al.  A distributed auction algorithm for the assignment problem , 2008, 2008 47th IEEE Conference on Decision and Control.

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

[28]  Peter N. Belhumeur,et al.  Closing ranks in vehicle formations based on rigidity , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[29]  Brian D. O. Anderson,et al.  Analysis of Noisy Bearing-Only Network Localization , 2013, IEEE Transactions on Automatic Control.

[30]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[31]  Soummya Kar,et al.  Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise , 2007, IEEE Transactions on Signal Processing.

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

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

[34]  Brian D. O. Anderson,et al.  Multi-agent rigid formations: A study of robustness to the loss of multiple agents , 2011, IEEE Conference on Decision and Control and European Control Conference.

[35]  T. Eren,et al.  Using Angle of Arrival (Bearing) Information in Network Localization , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

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

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

[39]  Adam Dunkels,et al.  An adaptive communication architecture for wireless sensor networks , 2007, SenSys '07.

[40]  B. Anderson,et al.  Sensor and network topologies of formations with direction, bearing, and angle information between agents , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

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

[42]  Tibor Jordán,et al.  A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid , 2003, J. Comb. Theory, Ser. B.

[43]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

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

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

[46]  Frank Allgöwer,et al.  Growing optimally rigid formations , 2012, 2012 American Control Conference (ACC).