MAX-consensus in open multi-agent systems with gossip interactions

Abdelrahim, Mahmoud;Hendrickx, Julien;Heemels, Maurice
(2017) Proceedings of the 56th IEEE Conference on Decision and Control (CDC 2017) — Location: Melbourne(Australia) (12.December.2017)

Files

170905793.pdf
  • Closed Access
  • Adobe PDF
  • 474.26 KB
Request a copy

Details

Authors
  • Abdelrahim, MahmoudAssiut university, Egypt
    Author
  • Hendrickx, Julienorcid-logoUCLouvain
    Author
  • Heemels, MauriceEindhoven university, the Netherlands
    Author
Abstract
We study the problem of distributed maximum computation in an open multi-agent system, where agents can leave and arrive during the execution of the algorithm. The mainchallengecomesfromthepossibilitythattheagentholding the largest value leaves the system, which changes the value to be computed. The algorithms must as a result be endowed with mechanisms allowing to forget outdated information. The focus is on systems in which interactions are pairwise gossips betweenrandomlyselectedagents.Weconsidersituationswhere leaving agents can send a last message, and situations where they cannot. For both cases, we provide algorithms able to eventually compute the maximum of the values held by agents.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Abdelrahim, M., Hendrickx, J., & Heemels, M. (2017). MAX-consensus in open multi-agent systems with gossip interactions. Proceedings of the 56th IEEE Conference on Decision and Control (CDC 2017), p. 4753-4758. https://hdl.handle.net/2078.5/254814