Repeated auctions for robust task execution by a robot team

Maitreyi Nanjanath; Maria Gini

doi:10.1016/j.robot.2010.03.011

Repeated auctions for robust task execution by a robot team

Maitreyi Nanjanath, Maria Gini

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

102 Scopus citations

Abstract

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)
Pages (from-to)	900-909
Number of pages	10
Journal	Robotics and Autonomous Systems
Volume	58
Issue number	7
DOIs	https://doi.org/10.1016/j.robot.2010.03.011
State	Published - 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 .

Keywords

Auctions
Multi-robot teams
Task allocation

Access

10.1016/j.robot.2010.03.011

OpenUrl availability

Full text

Cite this

@article{420233add9b243fbacfcf900227bf631,

title = "Repeated auctions for robust task execution by a robot team",

abstract = "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.",

keywords = "Auctions, Multi-robot teams, Task allocation",

author = "Maitreyi Nanjanath and Maria Gini",

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 . ",

year = "2010",

month = jul,

day = "31",

doi = "10.1016/j.robot.2010.03.011",

language = "English (US)",

volume = "58",

pages = "900--909",

journal = "Robotics and Autonomous Systems",

issn = "0921-8890",

publisher = "Elsevier",

number = "7",

}

TY - JOUR

T1 - Repeated auctions for robust task execution by a robot team

AU - Nanjanath, Maitreyi

AU - Gini, Maria

N1 - 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 .

PY - 2010/7/31

Y1 - 2010/7/31

N2 - 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.

AB - 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.

KW - Auctions

KW - Multi-robot teams

KW - Task allocation

UR - http://www.scopus.com/inward/record.url?scp=78049445672&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049445672&partnerID=8YFLogxK

U2 - 10.1016/j.robot.2010.03.011

DO - 10.1016/j.robot.2010.03.011

M3 - Article

AN - SCOPUS:78049445672

SN - 0921-8890

VL - 58

SP - 900

EP - 909

JO - Robotics and Autonomous Systems

JF - Robotics and Autonomous Systems

IS - 7

ER -

Repeated auctions for robust task execution by a robot team

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this