Decentralized and Parallel Constructionsfor Optimally Rigid Graphs in $\mathbb{R}^2$

In this paper, we address the decentralized and parallel construction of rigid graphs in the plane that optimize an edge-weighted objective function under cardinality constraints. Two auction-based algorithms to solve this problem in a decentralized fashion are first proposed. Centered around the notion of leader election, the first approach finds an optimal solution through a greedy bidding, while the second approach provides a sub-optimal solution which reduces complexity according to a sliding mode parameter. Then, by exploiting certain local structural properties of graph rigidity, a parallelization to build a portion of the optimal solution in constant time is derived. A theoretical characterization of algorithm performance is provided together with complexity analysis. Finally, simulation results are presented to corroborate the theoretical findings.

[1]  Lynne E. Parker,et al.  Guest editorial advances in multirobot systems , 2002, IEEE Trans. Robotics Autom..

[2]  Dale Anthony Carnegie,et al.  Mapping and exploration in a hierarchical heterogeneous multi-robot system using limited capability robots , 2013, Robotics Auton. Syst..

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

[4]  Yunhao Liu,et al.  Understanding Node Localizability of Wireless Ad Hoc and Sensor Networks , 2012, IEEE Transactions on Mobile Computing.

[5]  Antonio Bicchi,et al.  Consensus-based distributed intrusion detection for multi-robot systems , 2008, 2008 IEEE International Conference on Robotics and Automation.

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

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

[8]  Gaurav S. Sukhatme,et al.  Probabilistic spatial mapping and curve tracking in distributed multi-agent systems , 2012, 2012 IEEE International Conference on Robotics and Automation.

[9]  Victor Reiner,et al.  Rigidity theory for matroids , 2005 .

[10]  Tamer A. ElBatt,et al.  Joint scheduling and power control for wireless ad hoc networks , 2002, IEEE Transactions on Wireless Communications.

[11]  B. Widrow,et al.  Statistical theory of quantization , 1996 .

[12]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[13]  Bhaskar Krishnamachari,et al.  Fast Data Collection in Tree-Based Wireless Sensor Networks , 2012, IEEE Transactions on Mobile Computing.

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

[15]  Andrea Gasparri,et al.  A distributed Transferable Belief Model for collaborative topological map-building in multi-robot systems , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  Wenwu Yu,et al.  An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination , 2012, IEEE Transactions on Industrial Informatics.

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

[18]  Mehran Mesbahi,et al.  Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis , 2011, IEEE Transactions on Automatic Control.

[19]  Lynne E. Parker,et al.  Editorial: Advances in Multi-Robot Systems , 2002 .

[20]  Pushmeet Kohli,et al.  Tractability: Practical Approaches to Hard Problems , 2013 .

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

[22]  Ivan Stojmenovic,et al.  Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation , 2004, IEEE Transactions on Parallel and Distributed Systems.

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

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

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

[26]  Ali Jadbabaie,et al.  Decentralized Control of Connectivity for Multi-Agent Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[27]  Stephan Gruber,et al.  PermaSense: investigating permafrost with a WSN in the Swiss Alps , 2007, EmNets '07.

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

[29]  Srikanth V. Krishnamurthy,et al.  Topology Management in Directional Antenna-Equipped Ad Hoc Networks , 2009, IEEE Transactions on Mobile Computing.

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

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

[32]  J. Oxley.  Matroid Theory (Oxford Graduate Texts in Mathematics) , 2006 .

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

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

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

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

[37]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

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

[39]  Andrea Gasparri,et al.  A spatially structured genetic algorithm for multi-robot localization , 2009, Intell. Serv. Robotics.

[40]  Lino Marques,et al.  User interfaces for human robot interactions with a swarm of robots in support to firefighters , 2010, 2010 IEEE International Conference on Robotics and Automation.

[41]  Andreas Krause,et al.  Submodular Function Maximization , 2014, Tractability.

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

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

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

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

[46]  Gaurav S. Sukhatme,et al.  Using Local Geometry for Tunable Topology Control in Sensor Networks , 2009, IEEE Transactions on Mobile Computing.

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

[48]  Gaurav S. Sukhatme,et al.  A framework for multi-robot node coverage in sensor networks , 2008, Annals of Mathematics and Artificial Intelligence.

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