A Delayed Consensus Algorithm in Networks of Anticipatory Agents

Abstract : — We introduce and analyze a delayed consensus algorithm as a model for interacting agents using anticipation of their neighbors' states to improve convergence to consensus. We derive a necessary and sufficient condition for the system to reach consensus. Furthermore, we explicitly calculate the dominant characteristic root of the consensus problem as a measure of the speed of convergence. The results show that the anticipatory algorithm can improve the speed of consensus, especially in networks with poor connectivity. Hence, anticipation can improve performance in networks if the delay parameter is chosen judiciously, otherwise the system might diverge as agents try to anticipate too aggressively into the future.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01418195
Contributor : Dina Irofti <>
Submitted on : Friday, December 16, 2016 - 2:15:35 PM
Last modification on : Monday, August 20, 2018 - 9:44:02 AM
Long-term archiving on : Tuesday, March 21, 2017 - 10:40:52 AM

File

root.pdf
Files produced by the author(s)

Identifiers

Citation

Fatihcan Atay, Dina Irofti. A Delayed Consensus Algorithm in Networks of Anticipatory Agents. 15th European Control Conference (ECC 2016), Jun 2016, Aalborg, Denmark. ⟨10.1109/ecc.2016.7810565 ⟩. ⟨hal-01418195⟩

Share

Metrics

Record views

136

Files downloads

318