Asynchronous consensus protocols for multi-agent systems

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

Abstract

Motivated by the famous Vicsek's model, this paper addresses the problem of heading consensus for a multiagent group by using asynchronous decentralized algorithms. Two algorithms, one for the leaderless case and one for the leader based case are proposed. The appealing feature of both algorithms is that neither a global coordinate system nor a common clock is required. It is proved that these algorithms guarantee (almost) global consensus of the headings under some well known connectivity assumptions.

Original languageEnglish (US)
Title of host publicationProceedings of the 2009 IEEE International Conference on Automation and Logistics, ICAL 2009
Pages955-960
Number of pages6
DOIs
StatePublished - 2009
Event2009 IEEE International Conference on Automation and Logistics, ICAL 2009 - Shenyang, China
Duration: Aug 5 2009Aug 7 2009

Other

Other2009 IEEE International Conference on Automation and Logistics, ICAL 2009
CountryChina
CityShenyang
Period8/5/098/7/09

Fingerprint

Multi agent systems
Clocks

Keywords

  • Asynchronous algorithms
  • Consensus
  • Decentralized coordination
  • Multi-agent systems

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition

Cite this

Li, Q., & Jiang, Z-P. (2009). Asynchronous consensus protocols for multi-agent systems. In Proceedings of the 2009 IEEE International Conference on Automation and Logistics, ICAL 2009 (pp. 955-960). [5262557] https://doi.org/10.1109/ICAL.2009.5262557

Asynchronous consensus protocols for multi-agent systems. / Li, Qin; Jiang, Zhong-Ping.

Proceedings of the 2009 IEEE International Conference on Automation and Logistics, ICAL 2009. 2009. p. 955-960 5262557.

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

Li, Q & Jiang, Z-P 2009, Asynchronous consensus protocols for multi-agent systems. in Proceedings of the 2009 IEEE International Conference on Automation and Logistics, ICAL 2009., 5262557, pp. 955-960, 2009 IEEE International Conference on Automation and Logistics, ICAL 2009, Shenyang, China, 8/5/09. https://doi.org/10.1109/ICAL.2009.5262557
Li Q, Jiang Z-P. Asynchronous consensus protocols for multi-agent systems. In Proceedings of the 2009 IEEE International Conference on Automation and Logistics, ICAL 2009. 2009. p. 955-960. 5262557 https://doi.org/10.1109/ICAL.2009.5262557
Li, Qin ; Jiang, Zhong-Ping. / Asynchronous consensus protocols for multi-agent systems. Proceedings of the 2009 IEEE International Conference on Automation and Logistics, ICAL 2009. 2009. pp. 955-960
@inproceedings{2fd5d43d352647cfab838c70540497ad,
title = "Asynchronous consensus protocols for multi-agent systems",
abstract = "Motivated by the famous Vicsek's model, this paper addresses the problem of heading consensus for a multiagent group by using asynchronous decentralized algorithms. Two algorithms, one for the leaderless case and one for the leader based case are proposed. The appealing feature of both algorithms is that neither a global coordinate system nor a common clock is required. It is proved that these algorithms guarantee (almost) global consensus of the headings under some well known connectivity assumptions.",
keywords = "Asynchronous algorithms, Consensus, Decentralized coordination, Multi-agent systems",
author = "Qin Li and Zhong-Ping Jiang",
year = "2009",
doi = "10.1109/ICAL.2009.5262557",
language = "English (US)",
isbn = "9781424447954",
pages = "955--960",
booktitle = "Proceedings of the 2009 IEEE International Conference on Automation and Logistics, ICAL 2009",

}

TY - GEN

T1 - Asynchronous consensus protocols for multi-agent systems

AU - Li, Qin

AU - Jiang, Zhong-Ping

PY - 2009

Y1 - 2009

N2 - Motivated by the famous Vicsek's model, this paper addresses the problem of heading consensus for a multiagent group by using asynchronous decentralized algorithms. Two algorithms, one for the leaderless case and one for the leader based case are proposed. The appealing feature of both algorithms is that neither a global coordinate system nor a common clock is required. It is proved that these algorithms guarantee (almost) global consensus of the headings under some well known connectivity assumptions.

AB - Motivated by the famous Vicsek's model, this paper addresses the problem of heading consensus for a multiagent group by using asynchronous decentralized algorithms. Two algorithms, one for the leaderless case and one for the leader based case are proposed. The appealing feature of both algorithms is that neither a global coordinate system nor a common clock is required. It is proved that these algorithms guarantee (almost) global consensus of the headings under some well known connectivity assumptions.

KW - Asynchronous algorithms

KW - Consensus

KW - Decentralized coordination

KW - Multi-agent systems

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

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

U2 - 10.1109/ICAL.2009.5262557

DO - 10.1109/ICAL.2009.5262557

M3 - Conference contribution

AN - SCOPUS:70450172323

SN - 9781424447954

SP - 955

EP - 960

BT - Proceedings of the 2009 IEEE International Conference on Automation and Logistics, ICAL 2009

ER -