首页 /研究 /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

发表年份
2005
引用次数
294
访问权限
开放获取

摘要

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.

关键词

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

相关论文

查看 SWARM 分类全部论文