Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2005 | Robotics: Science and Systems | Computer science,Artificial intelligence,Robot,Bidding,Machine learning,Distributed computing |
DocType | Citations | PageRank |
Conference | 116 | 6.08 |
References | Authors | |
9 | 9 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michail G. Lagoudakis | 1 | 1164 | 79.51 |
| Evangelos Markakis | 2 | 1225 | 86.93 |
| David Kempe | 3 | 5891 | 403.41 |
| Pinar Keskinocak | 4 | 853 | 62.87 |
| Anton J. Kleywegt | 5 | 1084 | 85.19 |
| Sven Koenig | 6 | 3125 | 361.22 |
| Craig A. Tovey | 7 | 716 | 68.57 |
| Adam Meyerson | 8 | 2132 | 146.08 |
| Sonal Jain | 9 | 148 | 9.29 |