中国物理B ›› 2008, Vol. 17 ›› Issue (10): 3531-3535.doi: 10.1088/1674-1056/17/10/001

• GENERAL •    下一篇

Consensus protocol for multi-agent continuous systems

谭拂晓1, 关新平1, 刘德荣2   

  1. (1)College of Electrical Engineering, Yanshan University, Qinhuangdao 066004, China; (2)Department of the Electrical and Computer Engineering, University of Illinois at Chicago, U.S.A
  • 收稿日期:2007-10-31 修回日期:2007-12-11 出版日期:2008-10-20 发布日期:2008-10-20
  • 基金资助:
    Project supported by the National Science Fund for distinguished Young Scholars of China (Grant No 60525303) and the Specialized Research Fund for the Doctoral Program of High Education of China (Grant No 20050216001).

Consensus protocol for multi-agent continuous systems

Tan Fu-Xiao(谭拂晓)a)†, Guan Xin-Ping(关新平)a), and Liu De-Rong(刘德荣)b)   

  1. a College of Electrical Engineering, Yanshan University, Qinhuangdao 066004, China; b Department of the Electrical and Computer Engineering, University of Illinois at Chicago, U.S.A
  • Received:2007-10-31 Revised:2007-12-11 Online:2008-10-20 Published:2008-10-20
  • Supported by:
    Project supported by the National Science Fund for distinguished Young Scholars of China (Grant No 60525303) and the Specialized Research Fund for the Doctoral Program of High Education of China (Grant No 20050216001).

PDF (PC)

952

赞

摘要： Based on the algebraic graph theory, the networked multi-agent continuous systems are investigated. Firstly, the digraph (directed graph) represents the topology of a networked system, and then a consensus convergence criterion of system is proposed. Secondly, the issue of stability of multi-agent systems and the consensus convergence problem of information states are all analysed. Furthermore, the consensus equilibrium point of system is proved to be global and asymptotically reach the convex combination of initial states. Finally, two examples are taken to show the effectiveness of the results obtained in this paper.

Abstract: Based on the algebraic graph theory, the networked multi-agent continuous systems are investigated. Firstly, the digraph (directed graph) represents the topology of a networked system, and then a consensus convergence criterion of system is proposed. Secondly, the issue of stability of multi-agent systems and the consensus convergence problem of information states are all analysed. Furthermore, the consensus equilibrium point of system is proved to be global and asymptotically reach the convex combination of initial states. Finally, two examples are taken to show the effectiveness of the results obtained in this paper.

Key words: multi-agent systems, consensus protocol, graph Laplacian, asymptotically stable

中图分类号:  (Combinatorics; graph theory)

  • 02.10.Ox
02.10.Ab (Logic and set theory) 02.10.Yn (Matrix theory) 02.40.Re (Algebraic topology)