Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/MRS.2017.8250928 | 2017 International Symposium on Multi-Robot and Multi-Agent Systems (MRS) |
Keywords | Field | DocType |
sequential auction,parallel auction,Prim Allocation Auction,communication channel,harsh communication environments,multirobot task allocation,G-Prim Auction | Resource management,Mathematical optimization,Random variable,Lossy compression,Computer science,Communication channel,Common value auction,Robot,Valuation (finance),Cost accounting | Conference |
ISBN | Citations | PageRank |
978-1-5090-6310-9 | 1 | 0.41 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael W. Otte | 1 | 105 | 15.06 |
| Michael Kuhlman | 2 | 18 | 3.19 |
| Donald A. Sofge | 3 | 95 | 24.77 |