Tunable routing solutions for multi-robot navigation via the assignment problem: A 3D representation of the matching graph

In scenarios in which new robots and tasks are added to a network of already deployed, interchangeable robots, a trade-off arises in minimizing the cost to execute the tasks and the level of disruption to the system. This paper considers a navigation-oriented variant of this problem and proposes a parametrizable method to adjust the optimization criterion: from minimizing global travel time (or energy, or distance), to minimizing interruption (i.e., obtaining the fewest number of robot reassignments), and mixtures in-between. Paths are computed by a task-allocation formulation in which the destinations of newly deployed robots are added to an existing allocation. We adapt the graph matching variant of the Hungarian algorithm-originally designed to solve the optimal assignment problem in complete graphs-to construct routing paths by showing that there is an interpretation of the sparse Hungarian bipartite graph in three dimensions. When new agent-task pairs are inserted, the assignment is reallocated in an incremental fashion in linear time (assuming traversal choices are limited in number). The algorithm is studied systematically in simulation and also validated with physical robots.

[1]  Richard T. Vaughan,et al.  The Player/Stage Project: Tools for Multi-Robot and Distributed Sensor Systems , 2003 .

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

[3]  Stefano Giordani,et al.  A Distributed Algorithm for the Multi-Robot Task Allocation Problem , 2010, IEA/AIE.

[4]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[5]  Dimitri P. Bertsekas,et al.  An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..

[6]  Tucker R. Balch,et al.  Behavior-based formation control for multirobot teams , 1998, IEEE Trans. Robotics Autom..

[7]  Paul A. Beardsley,et al.  Multi-robot system for artistic pattern formation , 2011, 2011 IEEE International Conference on Robotics and Automation.

[8]  M. Bernardine Dias,et al.  The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs , 2007 .

[9]  Wei Ren,et al.  Distributed coordination architecture for multi-robot formation control , 2008, Robotics Auton. Syst..

[10]  Wei-Min Shen,et al.  Distributed and dynamic task reallocation in robot organizations , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[11]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[12]  Vijay Kumar,et al.  Distributed multi-robot task assignment and formation control , 2008, 2008 IEEE International Conference on Robotics and Automation.

[13]  Seth Copen Goldstein,et al.  A scalable distributed algorithm for shape transformation in multi-robot systems , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  Dimitri P. Bertsekas,et al.  The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial , 1990 .

[15]  Sarit Kraus,et al.  Task reallocation in multi-robot formations , 2010 .

[16]  Dylan A. Shell,et al.  Large-scale multi-robot task allocation via dynamic partitioning and distribution , 2012, Auton. Robots.

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

[18]  Wolfram Burgard,et al.  Coordinated multi-robot exploration using a segmentation of the environment , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[19]  Vijay Kumar,et al.  Decentralized Multirobot Control in Partially Known Environments with Dynamic Task Reassignment , 2012 .

[20]  Dylan A. Shell,et al.  Assessing optimal assignment under uncertainty: An interval-based algorithm , 2010, Int. J. Robotics Res..

[21]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[22]  Timo Latvala,et al.  On Scaling Multi-Agent Task Reallocation Using Market-Based Approach , 2007, First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007).

[23]  Dieter Fox,et al.  Adapting the Sample Size in Particle Filters Through KLD-Sampling , 2003, Int. J. Robotics Res..

[24]  G.H. Elkaim,et al.  A lightweight formation control methodology for a swarm of non-holonomic vehicles , 2006, 2006 IEEE Aerospace Conference.

[25]  Ismail Hakki Toroslu,et al.  Incremental assignment problem , 2007, Inf. Sci..

[26]  Dieter Fox,et al.  KLD-Sampling: Adaptive Particle Filters , 2001, NIPS.

[27]  Andreas Klappenecker,et al.  Approximate characterization of multi-robot swarm “shapes” in sublinear-time , 2011, 2011 IEEE International Conference on Robotics and Automation.

[28]  Iwan Ulrich,et al.  VFH+: reliable obstacle avoidance for fast mobile robots , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[29]  Noa Agmon,et al.  Multi-robot area patrol under frequency constraints , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.