Carnegie Mellon Robotics Institute
Robert Michael Zlot and Anthony (Tony) Stentz
Proceedings of the International Conference on Robotics and Automation, April, 2005, pp. 1515 - 1522.
| Download |
|
| Abstract |
| Recent research trends and technology developments are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missions. However, existing multirobot task allocation mechanisms treat tasks as simple, indivisible entities and ignore any inherent structure and semantics that such complex tasks might have. These properties can be exploited to produce more efficient team plans by giving individual robots the ability to come up with new ways to perform a task, or by allowing multiple robots to cooperate by sharing the subcomponents of a task, or both. In this paper, we introduce the complex task allocation problem and describe a distributed solution for efficiently allocating a set of complex tasks to a robot team. The advantages of explicitly modeling complex tasks during the allocation process is demonstrated by a comparison of our approach with existing task allocation algorithms in an area reconnaissance scenario. An implementation on a team of outdoor robots further validates our approach. |
| Keywords |
| multirobot coordination, market-based, complex tasks |
| Notes |
Associated Center(s) / Consortia:
Field Robotics Center Number of pages: 8 |
| Text Reference |
| Robert Michael Zlot and Anthony (Tony) Stentz, "Complex Task Allocation For Multiple Robots," Proceedings of the International Conference on Robotics and Automation, April, 2005, pp. 1515 - 1522. |
| BibTeX Reference |
|
@inproceedings{Zlot_2005_4961, author = "Robert Michael Zlot and Anthony (Tony) Stentz", title = "Complex Task Allocation For Multiple Robots", booktitle = "Proceedings of the International Conference on Robotics and Automation", pages = "1515 - 1522", publisher = "IEEE", month = "April", year = "2005", } |
| The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University. Contact Us | Update Instructions |