Target Assignment in Robotic Networks: Distance Optimality Guarantees and Hierarchical Strategies

We study the problem of multi-robot target assignment to minimize the total distance traveled by the robots until they all reach an equal number of static targets. In the first half of the paper, we present a necessary and sufficient condition under which true distance optimality can be achieved for robots with limited communication and target-sensing ranges. Moreover, we provide an explicit, non-asymptotic formula for computing the number of robots needed to achieve distance optimality in terms of the robots' communication and target-sensing ranges with arbitrary guaranteed probabilities. The same bounds are also shown to be asymptotically tight. In the second half of the paper, we present suboptimal strategies for use when the number of robots cannot be chosen freely. Assuming first that all targets are known to all robots, we employ a hierarchical communication model in which robots communicate only with other robots in the same partitioned region. This hierarchical communication model leads to constant approximations of true distance-optimal solutions under mild assumptions. We then revisit the limited communication and sensing models. By combining simple rendezvous-based strategies with a hierarchical communication model, we obtain decentralized hierarchical strategies that achieve constant approximation ratios with respect to true distance optimality. Results of simulation show that the approximation ratio is as low as 1.4.

[1]  Vikrant Sharma,et al.  Transfer Time Complexity of Conflict-free Vehicle Routing with no Communications , 2007, Int. J. Robotics Res..

[2]  János Komlós,et al.  On optimal matchings , 1984, Comb..

[3]  Walter L. Smith.  Probability and Statistics , 1959, Nature.

[4]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[5]  Saptarshi Bandyopadhyay,et al.  Phase synchronization control of complex networks of Lagrangian systems on adaptive digraphs , 2013, Autom..

[6]  M. Talagrand.  The Ajtai-Komlos-Tusnady Matching Theorem for General Measures , 1992 .

[7]  Kunihisa Okano,et al.  Stabilization of uncertain systems with finite data rates and Markovian packet losses , 2013, ECC.

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

[9]  Francesco Bullo,et al.  Monotonic Target Assignment for Robotic Networks , 2009, IEEE Transactions on Automatic Control.

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

[11]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[12]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[13]  Dimitri P. Bertsekas,et al.  Parallel synchronous and asynchronous implementations of the auction algorithm , 1991, Parallel Comput..

[14]  P. Erd6s.  ON A CLASSICAL PROBLEM OF PROBABILITY THEORY b , 2001 .

[15]  Emilio Frazzoli,et al.  Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems , 2012, IEEE Transactions on Automatic Control.

[16]  Howie Choset,et al.  Coverage of Known Spaces: The Boustrophedon Cellular Decomposition , 2000, Auton. Robots.

[17]  Magnus Egerstedt,et al.  Role-Assignment in Multi-Agent Coordination , 2006 .

[18]  Vijay Kumar,et al.  Goal Assignment and Trajectory Planning for Large Teams of Aerial Robots , 2013, Robotics: Science and Systems.

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

[20]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[21]  Feng Xue,et al.  On the connectivity and diameter of small-world networks , 2007, Advances in Applied Probability.

[22]  Pankaj K. Agarwal,et al.  A near-linear time ε-approximation algorithm for geometric bipartite matching , 2012, STOC '12.

[23]  Pravin M. Vaidya,et al.  Geometry helps in matching , 1989, STOC '88.

[24]  B. Bollobás,et al.  Connectivity of random k-nearest-neighbour graphs , 2005, Advances in Applied Probability.

[25]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[26]  M. Degroot,et al.  Probability and Statistics , 2021, Examining an Operational Approach to Teaching Probability.

[27]  Steven M. LaValle,et al.  Distance optimal formation control on graphs with a tight convergence time guarantee , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[28]  George J. Pappas,et al.  Dynamic Assignment in Distributed Motion Planning With Local Coordination , 2008, IEEE Transactions on Robotics.

[29]  Soon-Jo Chung,et al.  Distance optimal target assignment in robotic networks under communication and sensing constraints , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[30]  Brian D. O. Anderson,et al.  Connectivity of Large Wireless Networks under A Generic Connection Model , 2012, ArXiv.

[31]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[32]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[33]  Sonia Martínez,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.

[34]  Panganamala Ramana Kumar,et al.  Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks, and Computation , 2009, Proceedings of the IEEE.

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

[36]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[37]  Seth Hutchinson,et al.  Path planning for permutation-invariant multirobot formations , 2005, IEEE Transactions on Robotics.

[38]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case , 2007, SIAM J. Control. Optim..

[39]  Emilio Frazzoli,et al.  Asymptotically Optimal Algorithms for Pickup and Delivery Problems with Application to Large-Scale Transportation Systems , 2012, ArXiv.

[40]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case , 2007, SIAM J. Control. Optim..

[41]  Soon-Jo Chung,et al.  Traveled distance minimization and hierarchical strategies for robotic networks , 2014, 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP).