Affiliation:
1. Artificial Intelligence Lab, Stanford University, Stanford, CA 94305-9010, USA
2. Computer Science Department, University of Southern California, Los Angeles, CA 90089-0781, USA
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.
Subject
Applied Mathematics,Artificial Intelligence,Electrical and Electronic Engineering,Mechanical Engineering,Modeling and Simulation,Software
Reference31 articles.
1. The algorithmic analysis of hybrid systems
2. Atamtürk, A., Nemhauser, G., and Savelsbergh, M. 1995. A combined lagrangian, linear programming and implication heuristic for large-scale set partitioning problems . Journal of Heuristics 1: 247–259 .
3. A survey of heuristics for the weighted matching problem
4. On the Set-Covering Problem
5. Set Partitioning: A survey
Cited by
937 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献