A formal analysis and taxonomy of task allocation in multi-robot systems

被引:1087
作者
Gerkey, BP [1 ]
Mataric, MJ
机构
[1] Stanford Univ, Artificial Intelligence Lab, Stanford, CA 94305 USA
[2] Univ So Calif, Dept Comp Sci, Los Angeles, CA 90089 USA
关键词
task allocation; multi-robot systems; coordination; utility;
D O I
10.1177/0278364904045564
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
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.
引用
收藏
页码:939 / 954
页数:16
相关论文
共 69 条
[1]  
AGASSOUNON W, 2002, P IEEE C SYST MAN CY, P250
[2]  
AHL TS, 2002, P IEEE RSJ INT C INT, P1044
[3]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[4]   THE ALGORITHMIC ANALYSIS OF HYBRID SYSTEMS [J].
ALUR, R ;
COURCOUBETIS, C ;
HALBWACHS, N ;
HENZINGER, TA ;
HO, PH ;
NICOLLIN, X ;
OLIVERO, A ;
SIFAKIS, J ;
YOVINE, S .
THEORETICAL COMPUTER SCIENCE, 1995, 138 (01) :3-34
[5]  
[Anonymous], ANIMALS ANIMATS
[6]  
Atamturk A., 1996, Journal of Heuristics, V1, P247, DOI 10.1007/BF00127080
[7]   A SURVEY OF HEURISTICS FOR THE WEIGHTED MATCHING PROBLEM [J].
AVIS, D .
NETWORKS, 1983, 13 (04) :475-493
[8]   SET-COVERING PROBLEM [J].
BALAS, E ;
PADBERG, MW .
OPERATIONS RESEARCH, 1972, 20 (06) :1152-1161
[9]   SET PARTITIONING - SURVEY [J].
BALAS, E ;
PADBERG, MW .
SIAM REVIEW, 1976, 18 (04) :710-760
[10]   A LINEAR-TIME APPROXIMATION ALGORITHM FOR THE WEIGHTED VERTEX COVER PROBLEM [J].
BARYEHUDA, R ;
EVEN, S .
JOURNAL OF ALGORITHMS, 1981, 2 (02) :198-203