Home /Research /Auction-Based Multi-Robot Routing
SWARM

Auction-Based Multi-Robot Routing

Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pınar Keskinocak, Anton J. Kleywegt, Sven Koenig, Craig A. Tovey, Adam Meyerson, Sonal Jain

Year
2005
Citations
294
Access
Open access

Abstract

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.

Keywords

Variety (cybernetics)BiddingComputer scienceRobotRouting (electronic design automation)Auction theoryCombinatorial auctionOperations researchDistributed computingArtificial intelligence

Related papers

Browse all SWARM papers