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

Other

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

Fingerprint

Multi agent systems
Decentralized
Multi-agent Systems
Discrete-time
Connectivity
Justify
Simulation
Model

Keywords

  • Consensus
  • Decentralized algorithm
  • Vicsek's model

ASJC Scopus subject areas

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

Cite this

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

Decentralized discrete-time consensus algorithms for multi-agent systems. / Li, Qin; Jiang, Zhong-Ping.

Proceedings of the 26th Chinese Control Conference, CCC 2007. 2007. p. 721-725 4347378.

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

Li, Q & Jiang, Z-P 2007, Decentralized discrete-time consensus algorithms for multi-agent systems. in Proceedings of the 26th Chinese Control Conference, CCC 2007., 4347378, pp. 721-725, 26th Chinese Control Conference, CCC 2007, Zhangjiajie, China, 7/26/07. https://doi.org/10.1109/CHICC.2006.4347378
Li Q, Jiang Z-P. Decentralized discrete-time consensus algorithms for multi-agent systems. In Proceedings of the 26th Chinese Control Conference, CCC 2007. 2007. p. 721-725. 4347378 https://doi.org/10.1109/CHICC.2006.4347378
Li, Qin ; Jiang, Zhong-Ping. / Decentralized discrete-time consensus algorithms for multi-agent systems. Proceedings of the 26th Chinese Control Conference, CCC 2007. 2007. pp. 721-725
@inproceedings{067fc892b79c41bdb7903222c538e7d5,
title = "Decentralized discrete-time consensus algorithms for multi-agent systems",
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.",
keywords = "Consensus, Decentralized algorithm, Vicsek's model",
author = "Qin Li and Zhong-Ping Jiang",
year = "2007",
doi = "10.1109/CHICC.2006.4347378",
language = "English (US)",
isbn = "7900719229",
pages = "721--725",
booktitle = "Proceedings of the 26th Chinese Control Conference, CCC 2007",

}

TY - GEN

T1 - Decentralized discrete-time consensus algorithms for multi-agent systems

AU - Li, Qin

AU - Jiang, Zhong-Ping

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Consensus

KW - Decentralized algorithm

KW - Vicsek's model

UR - http://www.scopus.com/inward/record.url?scp=37749027629&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=37749027629&partnerID=8YFLogxK

U2 - 10.1109/CHICC.2006.4347378

DO - 10.1109/CHICC.2006.4347378

M3 - Conference contribution

AN - SCOPUS:37749027629

SN - 7900719229

SN - 9787900719225

SP - 721

EP - 725

BT - Proceedings of the 26th Chinese Control Conference, CCC 2007

ER -