Repeated auctions for robust task execution by a robot team

Maitreyi Nanjanath, Maria Gini

Research output: Contribution to journalArticlepeer-review

93 Scopus citations


We present empirical results of an auction-based algorithm for dynamic allocation of tasks to robots. The results have been obtained both in simulation and using real robots. A distinctive feature of our algorithm is its robustness to uncertainties and to robot malfunctions that happen during task execution, when unexpected obstacles, loss of communication, and other delays may prevent a robot from completing its allocated tasks. Therefore tasks not yet achieved are resubmitted for bids every time a task has been completed. This provides an opportunity to improve the allocation of the remaining tasks, enabling the robots to recover from failures and reducing the overall time for task completion.

Original languageEnglish (US)
Pages (from-to)900-909
Number of pages10
JournalRobotics and Autonomous Systems
Issue number7
StatePublished - Jul 31 2010

Bibliographical note

Funding Information:
Work supported in part by the National Science Foundation under grants EIA-0324864 and IIS-0414466 , and by the Industry/University Cooperative Research Center for Safety, Security, and Rescue at the University of Minnesota .


  • Auctions
  • Multi-robot teams
  • Task allocation


Dive into the research topics of 'Repeated auctions for robust task execution by a robot team'. Together they form a unique fingerprint.

Cite this