Auction-Based Multi-Robot Routing

M. Lagoudakis, E. Markakis, D. Kempe, P. Keskinocak, A. Kleywegt, Sven Koenig, C. Tovey, A. Meyerson, Sonal Jain
{"title":"Auction-Based Multi-Robot Routing","authors":"M. Lagoudakis, E. Markakis, D. Kempe, P. Keskinocak, A. Kleywegt, Sven Koenig, C. Tovey, A. Meyerson, Sonal Jain","doi":"10.15607/RSS.2005.I.045","DOIUrl":null,"url":null,"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.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"23 1","pages":"343-350"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"327","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics science and systems : online proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15607/RSS.2005.I.045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 327

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.
基于拍卖的多机器人路由
最近,拍卖方法作为一种有效的分散的多机器人协调方法被研究。实验研究显示出巨大的潜力,但理论分析尚未得到补充。本文对拍卖方法在多机器人布线中的性能进行了理论分析。我们提出了一个基于拍卖的多机器人路由的通用框架,并分析了不同团队目标的各种竞标规则。这是首次展示拍卖方法为如此多样化的竞标规则和团队目标提供理论保证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
12.00
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信