Auction-Based Multi-Robot Routing

Recently, auction methods have been investigated as effective, decentralized methods for multi-robot coordination. Experimental research has shown great potential, but has not been complemented yet by theoretical analysis. In this paper we contribute a theoretical analysis of the performance of auction methods for multi-robot routing. We suggest a generic framework for auction-based multi-robot routing and analyze a variety of bidding rules for different team objectives. This is the first time that auction methods are shown to offer theoretical guarantees for such a variety of bidding rules and team objectives.

[1]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[2]  Chul E. Kim,et al.  Approximation Algorithms for Some Routing Problems , 1978, SIAM J. Comput..

[3]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[4]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[5]  Steve Chien,et al.  A comparison of coordinated planning methods for cooperating rovers , 1999 .

[6]  Tara A. Estlin,et al.  A comparison of coordinated planning methods for cooperating rovers , 1999, AGENTS '00.

[7]  Anthony Stentz,et al.  A Free Market Architecture for Distributed Control of a Multirobot System , 2000 .

[8]  Anthony Stentz,et al.  Multi-robot exploration controlled by a market economy , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[9]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[10]  Anthony Stentz,et al.  Enhanced Negotiation and Opportunistic Optimization for Market-Based Multirobot Coordination , 2002 .

[11]  Satish Rao,et al.  The k-traveling repairman problem , 2003, SODA '03.

[12]  Anthony Stentz,et al.  Market-Based Multi-Robot Planning in a Distributed Layered Architecture , 2003 .

[13]  Sven Koenig,et al.  Robot exploration with combinatorial auctions , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[14]  R. Ravi,et al.  Min-max tree covers of graphs , 2004, Oper. Res. Lett..

[15]  Michail G. Lagoudakis,et al.  Simple auctions with performance guarantees for multi-robot task allocation , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[16]  Michail G. Lagoudakis,et al.  The Generation of Bidding Rules for Auction-Based Robot Coordination , 2005 .