Decentralized discrete-time consensus algorithms for multi-agent systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, inspired by Vicsek's model, two decentralized heading consensus algorithms, WHCA and LBHCA, are proposed. It is proved that, under some well-known connectivity assumption, the WHCA can ensure almost global consensus of the headings except the only situation where they are balanced at the beginning. For the LBHCA, the global heading consensus is guaranteed under the same connectivity assumption. Simulation results are provided to justify the proposed algorithms.

Original languageEnglish (US)
Title of host publicationProceedings of the 26th Chinese Control Conference, CCC 2007
Pages721-725
Number of pages5
DOIs
StatePublished - 2007
Event26th Chinese Control Conference, CCC 2007 - Zhangjiajie, China
Duration: Jul 26 2007Jul 31 2007

Publication series

NameProceedings of the 26th Chinese Control Conference, CCC 2007

Other

Other26th Chinese Control Conference, CCC 2007
CountryChina
CityZhangjiajie
Period7/26/077/31/07

Keywords

  • Consensus
  • Decentralized algorithm
  • Vicsek's model

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Systems Engineering
  • Applied Mathematics
  • Modeling and Simulation

Fingerprint Dive into the research topics of 'Decentralized discrete-time consensus algorithms for multi-agent systems'. Together they form a unique fingerprint.

  • Cite this

    Li, Q., & Jiang, Z. (2007). Decentralized discrete-time consensus algorithms for multi-agent systems. In Proceedings of the 26th Chinese Control Conference, CCC 2007 (pp. 721-725). [4347378] (Proceedings of the 26th Chinese Control Conference, CCC 2007). https://doi.org/10.1109/CHICC.2006.4347378