Skip to content
Free planNo credit card requiredStart writing

article · 2003

Multi-Robot Task-Allocation . . .

Torbjørn S. Dahl, Maja J. Matarić, Gaurav S. Sukhatme

Cited by 0Abstract and details only

Abstract

This paper presents an algorithm for task allocation in groups of homogeneous robots. The algorithm is based on vacancy chains, a resource distribution strategy common in human and animal societies. We define a class of task-allocation problems for which the vacancy chain algorithm is suitable and demonstrate how Reinforcement Learning can be used to make vacancy chains emerge in a group of Behavior-Based robots. Experiments in simulation show that the vacancy chain algorithm consistently outperforms random and static task allocation algorithms when individual robots are prone to distractions or breakdowns, or when task priorities change.

Cite this paper

APA 7

Dahl, T. S., Matarić, M. J., & Sukhatme, G. S. (2003). Multi-Robot Task-Allocation . . .

MLA 9

Dahl, Torbjørn S., et al. “Multi-Robot Task-Allocation . . .” 2003.

Chicago

Dahl, Torbjørn S., Maja J. Matarić, and Gaurav S. Sukhatme. 2003. “Multi-Robot Task-Allocation . . .”

Harvard

Dahl, T.S., Matarić, M.J. and Sukhatme, G.S. (2003) ‘Multi-Robot Task-Allocation . . ’.

BibTeX
@article{dahl2003multi,
  title = {{Multi-Robot Task-Allocation . . .}},
  author = {Dahl, Torbjørn S. and Matarić, Maja J. and Sukhatme, Gaurav S.},
  year = {2003}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.