Multi-robot task allocation with auctions in harsh communication environments

We evaluate three different auction algorithms for multi-robot task allocation when the communication channel is lossy. These include the Sequential Auction, the Parallel Auction, and a generalization of the Prim Allocation Auction called the G-Prim Auction. Each auction is evaluated in two different scenarios: (1) task valuations are random variables drawn from a distribution, and (2) tasks represent locations that must be visited and costs are defined by the extra distance required to visit each location. We derive closed-form solutions for the expected performance of the Sequential Auction and Parallel Auction in Scenario 1, bound the performance of G-Prim in Scenario 1, and bound the performance of the Parallel and Sequential Auctions in Scenario 2.

[1]  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).

[2]  Evangelos Markakis,et al.  Auction-Based Multi-Robot Routing , 2005, Robotics: Science and Systems.

[3]  Rachid Alami,et al.  M+: a scheme for multi-robot cooperation through negotiated task allocation and achievement , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[4]  B. J. Moore,et al.  Coping with information delays in the assignment of mobile agents to stationary tasks , 2004 .

[5]  Anthony Stentz,et al.  Robust multirobot coordination in dynamic environments , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

[7]  Nidhi Kalra,et al.  Market-Based Multirobot Coordination: A Survey and Analysis , 2006, Proceedings of the IEEE.

[8]  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).

[9]  M. Alighanbari,et al.  Decentralized Task Assignment for Unmanned Aerial Vehicles , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[10]  Sven Koenig,et al.  Progress on Agent Coordination with Cooperative Auctions , 2010, AAAI.

[11]  Manuela Veloso,et al.  DYNAMIC MULTI-ROBOT COORDINATION , 2003 .

[12]  Gaurav S. Sukhatme,et al.  Task-Allocation and Coordination of Multiple Robots for Planetary Exploration , 2001 .

[13]  Mark Yim,et al.  Indoor automation with many mobile robots , 1990, EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications.

[14]  E. Sklar,et al.  Evaluating auction-based task allocation in multi-robot teams , 2014 .

[15]  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).

[16]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[17]  Han-Lim Choi,et al.  Consensus-Based Decentralized Auctions for Robust Task Allocation , 2009, IEEE Transactions on Robotics.

[18]  Luiz Chaimowicz,et al.  Improving combinatorial auctions for multi-robot exploration , 2013, 2013 16th International Conference on Advanced Robotics (ICAR).

[19]  José Guerrero,et al.  Multi-Robot Task Allocation Strategies Using Auction-Like Mechanisms , 2003 .

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

[21]  Henrik I. Christensen,et al.  A Bayesian formulation for auction-based task allocation in heterogeneous multi-agent teams , 2011, Defense + Commercial Sensing.

[22]  Howie Choset,et al.  Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach , 2008, Annals of Mathematics and Artificial Intelligence.