• DocumentCode
    1803131
  • Title

    Consensus problem for high-order multi-agent systems

  • Author

    Wang, Zhengxin ; Cao, Jinde

  • Author_Institution
    Dept. of Math., Southeast Univ., Nanjing, China
  • fYear
    2011
  • fDate
    15-18 May 2011
  • Firstpage
    335
  • Lastpage
    340
  • Abstract
    This paper aims to study the consensus problem for high-order-integrator multi-agent systems. A consensus protocol is proposed, which only depends on the agent´s own partial information and its neighbors´ partial information, that is, the global information of agents and the full information of its neighbor are no need to be available. Some necessary lemmas were firstly presented, and then under the consensus protocol, a necessary and sufficient condition for guaranteeing the consensus is established. Finally, an illustrative example was given to verify the obtained theoretical result.
  • Keywords
    decision theory; graph theory; information theory; multi-agent systems; consensus problem; consensus protocol; global information; high-order-integrator multiagent systems; partial information; Acceleration; Eigenvalues and eigenfunctions; Graph theory; Multiagent systems; Polynomials; Protocols; Topology; algebraic graph theory; consensus; multi-agent systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control Conference (ASCC), 2011 8th Asian
  • Conference_Location
    Kaohsiung
  • Print_ISBN
    978-1-61284-487-9
  • Electronic_ISBN
    978-89-956056-4-6
  • Type

    conf

  • Filename
    5899094