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

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

doi:10.1109/CDC.2017.8264362

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

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

Control Systems Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

43 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 language	English
Title of host publication	2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
Pages	4753-4758
Number of pages	6
ISBN (Electronic)	9781509028733
DOIs	https://doi.org/10.1109/CDC.2017.8264362
Publication status	Published - 18 Jan 2018
Event	56th IEEE Conference on Decision and Control (CDC 2017) - Melbourne, VIC, Australia, Melbourne, Australia Duration: 12 Dec 2017 → 15 Dec 2017 Conference number: 56 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8253407

Conference

Conference	56th IEEE Conference on Decision and Control (CDC 2017)
Abbreviated title	CDC 2017
Country/Territory	Australia
City	Melbourne
Period	12/12/17 → 15/12/17
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8253407

Access to Document

10.1109/CDC.2017.8264362

Cite this

@inproceedings{7bbaaf6bf44a47758d639cd1f60470d9,

title = "MAX-consensus in open multi-agent systems with gossip interactions",

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.",

author = "Mahmoud Abdelrahim and Hendrickx, \{Julien M.\} and W.P.M.H. Heemels",

year = "2018",

month = jan,

day = "18",

doi = "10.1109/CDC.2017.8264362",

language = "English",

pages = "4753--4758",

booktitle = "2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017",

note = "56th IEEE Conference on Decision and Control (CDC 2017), CDC 2017 ; Conference date: 12-12-2017 Through 15-12-2017",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8253407",

}

TY - GEN

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

AU - Abdelrahim, Mahmoud

AU - Hendrickx, Julien M.

AU - Heemels, W.P.M.H.

N1 - Conference code: 56

PY - 2018/1/18

Y1 - 2018/1/18

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

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

UR - https://www.scopus.com/pages/publications/85046114041

U2 - 10.1109/CDC.2017.8264362

DO - 10.1109/CDC.2017.8264362

M3 - Conference contribution

SP - 4753

EP - 4758

BT - 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017

T2 - 56th IEEE Conference on Decision and Control (CDC 2017)

Y2 - 12 December 2017 through 15 December 2017

ER -

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

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this