Connectedness preserving distributed coordination control over dynamic graphs

被引：42

作者：

Ji, M ^{[1
]}

Egerstedt, M ^{[1
]}

机构：

[1] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA

来源：

ACC: PROCEEDINGS OF THE 2005 AMERICAN CONTROL CONFERENCE, VOLS 1-7 | 2005年

关键词：

D O I：

10.1109/ACC.2005.1469914

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents a solution to the limited information rendezvous problem over dynamic, interaction graphs. In particular, we show how we, by adding appropriate weights to the edges in the graphs, can guarantee that the graph stays connected. In previous work on graph-based coordination, connectedness have been assumed, and this paper thus shows how to overcome this limitation even when the graphs are subject to dynamic changes.

引用

页码：93 / 98

页数：6

共 22 条

[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]

AXELSSON H, 2003, IFAC C AN DES HYBR S

[3]

Desai JP, 1998, IEEE INT CONF ROBOT, P2864, DOI 10.1109/ROBOT.1998.680621

[4] Formation constrained multi-agent control [J].

Egerstedt, M ;

Hu, XM .

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2001, 17 (06) :947-951

[5] Information flow and cooperative control of vehicle formations [J].

Fax, JA ;

Murray, RM .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2004, 49 (09) :1465-1476

[6] Stability analysis of swarms [J].

Gazi, V ;

Passino, KM .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (04) :692-697

[7]

Godsil C., 2001, ALGEBRAIC GRAPH THEO

[8] 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

[9]

Lin J, 2003, 42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, P1508

[10]

LIN Z, 2004, IEEE T AUTOMATIC CON, P622

← 1 2 3 →