A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems
Top Cited Papers
- 1 September 2004
- journal article
- research article
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 23 (9) , 939-954
- https://doi.org/10.1177/0278364904045564
Abstract
Despite more than a decade of experimental work in multi-robot systems, important theoretical aspects of multi-robot coordination mechanisms have, to date, been largely untreated. To address this issue, we focus on the problem of multi-robot task allocation (MRTA). Most work on MRTA has been ad hoc and empirical, with many coordination architectures having been proposed and validated in a proof-of-concept fashion, but infrequently analyzed. With the goal of bringing objective grounding to this important area of research, we present a formal study of MRTA problems. A domain-independent taxonomy of MRTA problems is given, and it is shown how many such problems can be viewed as instances of other, well-studied, optimization problems. We demonstrate how relevant theory from operations research and combinatorial optimization can be used for analysis and greater understanding of existing approaches to task allocation, and to show how the same theory can be used in the synthesis of new approaches.Keywords
This publication has 53 references indexed in Scilit:
- Sold!: auction methods for multirobot coordinationIEEE Transactions on Robotics and Automation, 2002
- Planning and acting in partially observable stochastic domainsPublished by Elsevier ,1998
- ALLIANCE: an architecture for fault tolerant multirobot cooperationIEEE Transactions on Robotics and Automation, 1998
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- Collective Robotics: From Social Insects to RobotsAdaptive Behavior, 1993
- Online Weighted MatchingJournal of Algorithms, 1993
- A survey of heuristics for the weighted matching problemNetworks, 1983
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- Exact solution of crew scheduling problems using the set partitioning model: Recent successful applicationsNetworks, 1981
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955