Spatio-temporal multi-robot routing

In this paper, we consider the problem of routing multiple robots to service spatially distributed requests at specified time instants. We show that such a routing problem can be formulated as a pure assignment problem. Additionally, we incorporate connectivity constraints into the problem by requiring that range-constrained robots ensure a connected information exchange network at all times. We discuss the feasibility aspects of such a spatio-temporal routing problem, and derive the minimum number of robots required to service the requests. Moreover, we explicitly construct the corresponding routes for the robots, with the total length traveled as the cost to be minimized.

[1]  Hoa G. Nguyen,et al.  Autonomous Communication Relays for Tactical Robots , 2003 .

[2]  Emilio Frazzoli,et al.  Dynamic Vehicle Routing for Robotic Systems , 2011, Proceedings of the IEEE.

[3]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[4]  Han-Lim Choi,et al.  Ensuring network connectivity for decentralized planning in dynamic environments , 2011 .

[5]  Michail G. Lagoudakis,et al.  Multi-robot routing under limited communication range , 2008, 2008 IEEE International Conference on Robotics and Automation.

[6]  Magnus Egerstedt,et al.  Multi-robot routing for servicing spatio-temporal requests: A musically inspired problem , 2012, ADHS.

[7]  R.M. Murray,et al.  Motion planning with wireless network constraints , 2005, Proceedings of the 2005, American Control Conference, 2005..

[8]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

[9]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, Theor. Comput. Sci..

[10]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[11]  Magnus Egerstedt,et al.  Multi-robot routing under connectivity constraints , 2012 .

[12]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

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

[14]  Emilio Frazzoli,et al.  Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications , 2009, IEEE Transactions on Automatic Control.

[15]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[16]  R. J. Schilling,et al.  Decoupling of a Two-Axis Robotic Manipulator Using Nonlinear State Feedback: A Case Study , 1984 .

[17]  Eric W. Frew,et al.  Maintaining Optimal Communication Chains in Robotic Sensor Networks using Mobility Control , 2007, Mob. Networks Appl..

[18]  Mauro Dell'Amico,et al.  8. Quadratic Assignment Problems: Algorithms , 2009 .

[19]  Emilio Frazzoli,et al.  Dynamic vehicle routing with stochastic time constraints , 2010, 2010 IEEE International Conference on Robotics and Automation.

[20]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[21]  Warren E. Dixon,et al.  Information flow based connectivity maintenance of a multi-agent system during formation control , 2011, IEEE Conference on Decision and Control and European Control Conference.

[22]  Paolo Toth,et al.  Linear Assignment Problems , 1987 .

[23]  Wolfram Burgard,et al.  Coordinated multi-robot exploration , 2005, IEEE Transactions on Robotics.