109 citations · 430 across the 61 of their papers we have counts for
12 papers · 1 filter
Resource allocation in open multi-agent systems: an online optimization analysis
Renato Vizuete, Charles Monnoyer de Galland, Julien M. Hendrickx +2
The resource allocation problem consists of the optimal distribution of a budget between agents in a group. We consider such a problem in the context of open systems, where agents…
Random Coordinate Descent for Resource Allocation in Open Multi-Agent Systems
Charles Monnoyer de Galland, Renato Vizuete, Julien M. Hendrickx +2
We propose a method for analyzing the distributed random coordinate descent algorithm for solving separable resource allocation problems in the context of an open multiagent system…
Random coordinate descent algorithm for open multi-agent systems with complete topology and homogeneous agents
Charles Monnoyer de Galland, Renato Vizuete, Julien M. Hendrickx +2
We study the convergence in expectation of the Random Coordinate Descent algorithm (RCD) for solving optimal resource allocations problems in open multi-agent systems, i.e., multi-…
Evolution of Descriptors in Open Multi-Agent Systems for Gossip Interactions and Beyond
Charles Monnoyer de Galland, Samuel Martin, Julien M. Hendrickx +1
We consider open multi-agent systems, which are systems subject to frequent arrivals and departures of agents while the studied process takes place. We study the behavior of all-to…
Fundamental Performance Limitations for Average Consensus in Open Multi-Agent Systems
Charles Monnoyer de Galland, Julien M. Hendrickx
We derive fundamental performance limitations for intrinsic average consensus problems in open multi-agent systems, which are systems subject to frequent arrivals and departures of…
Lower bound performances for average consensus in open multi-agent systems (extended version)
Charles Monnoyer de Galland, Julien M. Hendrickx
We derive fundamental limitations on the performances of intrinsic averaging algorithms in open multi-agent systems, which are systems subject to random arrivals and departures of…
MAX-consensus in open multi-agent systems with gossip interactions
Mahmoud Abdelrahim, Julien M. Hendrickx, W. P. M. H. Heemels
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 c…
Open Multi-Agent Systems: Gossiping with Random Arrivals and Departures
Julien M. Hendrickx, Samuel Martin
We consider open multi-agent systems. Unlike the systems usually studied in the literature, here agents may join or leave while the process studied takes place. The system composit…
Finite-time consensus using stochastic matrices with positive diagonals
Julien M. Hendrickx, Guodong Shi, Karl H. Johansson
We discuss the possibility of reaching consensus in finite time using only linear iterations, with the additional restrictions that the update matrices must be stochastic with posi…
On Krause's multi-agent consensus model with state-dependent connectivity (Extended version)
Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis
We study a model of opinion dynamics introduced by Krause: each agent has an opinion represented by a real number, and updates its opinion by averaging all agent opinions that diff…
Rigidity and persistence for ensuring shape maintenance of multiagent meta formations (ext'd version)
Julien M. Hendrickx, Changbin Yu, Baris Fidan +1
This paper treats the problem of the merging of formations, where the underlying model of a formation is graphical. We first analyze the rigidity and persistence of meta-formations…
Primitive operations for the construction and reorganization of minimally persistent formations
Julien M. Hendrickx, Baris Fidan, Changbin Yu +2
In this paper, we study the construction and transformation of two-dimensional persistent graphs. Persistence is a generalization to directed graphs of the undirected notion of rig…