Necessary and sufficient graphical conditions for formation control of unicycles

被引:808
作者
Lin, ZY [1 ]
Francis, B [1 ]
Maggiore, M [1 ]
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada
关键词
distributed control; multiagent system; nonholonomic mobile robots;
D O I
10.1109/TAC.2004.841121
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The feasibility problem is studied of achieving a specified formation among a group of autonomous unicycles by local distributed control. The directed graph defined by the information flow plays a key role. It is proved that formation stabilization to a point is feasible if and only if the sensor digraph has a globally reachable node. A similar result is given for formation stabilization to a line and to more general geometric arrangements.
引用
收藏
页码:121 / 127
页数:7
相关论文
共 25 条
[1]   Distributed memoryless point convergence algorithm for mobile robots with limited visibility [J].
Ando, H ;
Oasa, Y ;
Suzuki, I ;
Yamashita, M .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1999, 15 (05) :818-828
[2]  
[Anonymous], 2002, DIGRAPHS THEORY ALGO
[3]  
BERAD RW, 2003, P 42 IEEE C DEC CONT, P2029
[4]   Modeling and control of formations of nonholonomic mobile robots [J].
Desai, JP ;
Ostrowski, JP ;
Kumar, V .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2001, 17 (06) :905-908
[5]  
Godsil C., 2001, ALGEBRAIC GRAPH THEO
[6]  
Hershkowitz D, 1998, ELECTRON J LINEAR AL, V4, P39
[7]   Coordination of groups of mobile autonomous agents using nearest neighbor rules [J].
Jadbabaie, A ;
Lin, J ;
Morse, AS .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (06) :988-1001
[8]  
JUSTH EW, 2000, P 42 IOEEE C DEC CON, P3609
[9]  
Khalil HK., 1992, NONLINEAR SYSTEMS
[10]  
LEONARD NE, 2000, P 40 IEEE C DEC CONT, P20968