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 language||English (US)|
|Title of host publication||Simulation, Modeling, and Programming for Autonomous Robots - First International Conference, SIMPAR 2008, Proceedings|
|Number of pages||11|
|ISBN (Print)||3540890750, 9783540890751|
|State||Published - 2008|
|Event||1st International Conference on Simulation, Modeling, and Programming for Autonomous Robots, SIMPAR 2008 - Venice, Italy|
Duration: Nov 3 2008 → Nov 6 2008
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||1st International Conference on Simulation, Modeling, and Programming for Autonomous Robots, SIMPAR 2008|
|Period||11/3/08 → 11/6/08|
Bibliographical noteFunding 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 .
Copyright 2021 Elsevier B.V., All rights reserved.