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

Mahmoud Abdelrahim, Julien M. Hendrickx, W.P.M.H. Heemels

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

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 main challenge comes from the possibility that the agent holding 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 between randomly selected agents. We consider situations where 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.

Original languageEnglish
Title of host publication2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages4753-4758
Number of pages6
ISBN (Electronic)978-1-5090-2873-3
ISBN (Print)978-1-5090-2874-0
DOIs
Publication statusPublished - 18 Jan 2018
Event56th IEEE Conference on Decision and Control (CDC 2017) - Melbourne, Australia
Duration: 12 Dec 201715 Dec 2017
Conference number: 56
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8253407

Conference

Conference56th IEEE Conference on Decision and Control (CDC 2017)
Abbreviated titleCDC 2017
CountryAustralia
CityMelbourne
Period12/12/1715/12/17
Internet address

Cite this