Repeated Sequential Auctions with Dynamic Task Clusters

Bradford Gregory John Heap, Maurice Pagnucco

AAAI 2012 pp. 1997-2002

doi:10.1609/AAAI.V26I1.8374 /aaai/2012/heap2012aaai-repeated/

Abstract

Sequential auctions can be used to provide solutions to the multi-robot task-allocation problem. In this paper we extend previous work on sequential auctions and propose an algorithm that clusters and auctions uninitiated task clusters repeatedly upon the completion of individual tasks. We demonstrate empirically that our algorithm results in lower overall team costs than other sequential auction algorithms that only assign tasks once.

PDF AAAI Semantic Scholar

Cite

Text

Heap and Pagnucco. "Repeated Sequential Auctions with Dynamic Task Clusters." AAAI Conference on Artificial Intelligence, 2012. doi:10.1609/AAAI.V26I1.8374

Markdown

[Heap and Pagnucco. "Repeated Sequential Auctions with Dynamic Task Clusters." AAAI Conference on Artificial Intelligence, 2012.](https://mlanthology.org/aaai/2012/heap2012aaai-repeated/) doi:10.1609/AAAI.V26I1.8374

BibTeX

@inproceedings{heap2012aaai-repeated,
  title     = {{Repeated Sequential Auctions with Dynamic Task Clusters}},
  author    = {Heap, Bradford Gregory John and Pagnucco, Maurice},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2012},
  pages     = {1997-2002},
  doi       = {10.1609/AAAI.V26I1.8374},
  url       = {https://mlanthology.org/aaai/2012/heap2012aaai-repeated/}
}