Decentralized control of vehicle formations

被引:508
作者
Lafferriere, G [1 ]
Williams, A [1 ]
Caughman, J [1 ]
Veerman, JJP [1 ]
机构
[1] Portland State Univ, Dept Math & Stat, Portland, OR 97207 USA
关键词
formation stability; graph Laplacian; algebraic graph theory; decentralized control; rooted directed spanning tree;
D O I
10.1016/j.sysconle.2005.02.004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper investigates a method for decentralized stabilization of vehicle formations using techniques from algebraic graph theory. The vehicles exchange information according to a pre-specified communication digraph, G. A feedback control is designed using relative information between a vehicle and its in-neighbors in G. We prove that a necessary and sufficient condition for an appropriate decentralized linear stabilizing feedback to exist is that G has a rooted directed spanning tree. We show the direct relationship between the rate of convergence to formation and the eigenvalues of the (directed) Laplacian of G. Various special situations are discussed, including symmetric communication graphs and formations with leaders. Several numerical simulations are used to illustrate the results. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:899 / 910
页数:12
相关论文
共 28 条
  • [1] Brualdi RA, 1991, ENCY MATH ITS APPL, V39
  • [2] CHUNG F, 1997, CMBS REGIONAL C SERI
  • [3] DECASTRO GA, P AM CONTR C JUN 200, P4933
  • [4] FAX J, 2001, THESIS CALIFORNIA I
  • [5] Information flow and cooperative control of vehicle formations
    Fax, JA
    Murray, RM
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2004, 49 (09) : 1465 - 1476
  • [6] FIEDLER M, 1973, CZECH MATH J, V23, P298
  • [7] GLAVASKI S, 2002, VEHICLE NETWORKS ACH
  • [8] Godsil C.D., 1993, Chapman and Hall Mathematics Series
  • [9] Coordination of groups of mobile autonomous agents using nearest neighbor rules
    Jadbabaie, A
    Lin, J
    Morse, AS
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (06) : 988 - 1001
  • [10] LAGGERRIERE G, 2004, ACC2004, P3724