Decentralized generic rigidity evaluation in interconnected systems

In this paper, we consider the problem of evaluating the generic rigidity of an interconnected system in the plane, without a priori knowledge of the network's topological properties. We propose the decentralization of the pebble game algorithm of Jacobs et. al., an O(n2) method that determines the generic rigidity of a planar network. Our decentralization is based on asynchronous inter-agent message-passing and a distributed memory architecture, coupled with consensus-based auctions for electing leaders in the system. We provide analysis of the asynchronous messaging structure and its interaction with leader election, and Monte Carlo simulations demonstrating complexity and correctness. Finally, a novel rigidity evaluation and control scenario in the accompanying media illustrates the applicability of our proposed algorithm.

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

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

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

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

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

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

[7]  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..

[8]  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..

[9]  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).

[10]  Sulema Aranda,et al.  On Optimal Sensor Placement and Motion Coordination for Target Tracking , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

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

[12]  Francesco Bullo,et al.  Optimal sensor placement and motion coordination for target tracking , 2006, Autom..

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

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

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

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

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

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

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

[20]  Mac Schwager,et al.  Persistent Robotic Tasks: Monitoring and Sweeping in Changing Environments , 2011, IEEE Transactions on Robotics.

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

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

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

[24]  Andrea Gasparri,et al.  Route swarm: Wireless network optimization through mobility , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.