Consensus Algorithms for Single-Integrator Multi-Agent Systems

In multi-agent systems reaching consensus has been a long-standing problem. A considerable amount of research has been focused on how event-triggered consensus can be used to limit the energy consumption of the communication system while still ensuring convergence to the neighbourhood of a point or a formation. These algorithms rely on having...

Optimal Selection and Tracking of Generalized Nash Equilibria in Monotone Games

A fundamental open problem in monotone game theory is the computation of a specific generalized Nash equilibrium (GNE) among all the available ones, e.g. the optimal equilibrium with respect to a system-level objective. The existing GNE seeking algorithms have in fact convergence guarantees toward an arbitrary, possibly inefficient,...

Payoff distribution in robust coalitional games on time-varying networks

In this article, we consider a sequence of transferable utility coalitional games, where the actual coalitional values are unknown but vary within known bounds. As a solution to the resulting family of games, we formalize the notion of 'robust core.' Our main contribution is to design two distributed algorithms, namely 1) distributed payoff...

Distributed Time-Varying Optimization of Second-Order Multiagent Systems Under Limited Interaction Ranges

This article investigates the distributed time-varying optimization problem for second-order multiagent systems (MASs) under limited interaction ranges. The goal is to seek the minimum of the sum of local time-varying cost functions (CFs), where each CF is only available to the corresponding agent. Limited communication range refers to the...

Fast generalized Nash equilibrium seeking under partial-decision information

We address the generalized Nash equilibrium seeking problem in a partial-decision information scenario, where each agent can only exchange information with some neighbors, although its cost function possibly depends on the strategies of all agents. The few existing methods build on projected pseudo-gradient dynamics, and require either double...

Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents

We consider strongly monotone games with convex separable coupling constraints, played by dynamical agents, in a partial-decision information scenario. We start by designing continuous-time fully distributed feedback controllers, based on consensus and primal–dual gradient dynamics, to seek a generalized Nash equilibrium in networks of single...

A tutorial on modeling and analysis of dynamic social networks. Part II

Recent years have witnessed a significant trend towards filling the gap between Social Network Analysis (SNA) and control theory. This trend was enabled by the introduction of new mathematical models describing dynamics of social groups, the development of algorithms and software for data analysis and the tremendous progress in understanding...

A tutorial on modeling and analysis of dynamic social networks. Part I

In recent years, we have observed a significant trend towards filling the gap between social network analysis and control. This trend was enabled by the introduction of new mathematical models describing dynamics of social groups, the advancement in complex networks theory and multi-agent systems, and the development of modern computational...

Dynamic improvement of robustness of power transmission grids in decentralized and distributed environments

Power transmission networks are large scale complex distributed and networked systems, situated in dynamic environments. Managing such systems is essentially decentralized and distributed. The main function of power transmission grids is to assure the security and reliability of the network and to avoid blackouts. Key elements that can determine...

Coordination by design and the price of autonomy

We consider a multi-agent planning problem as a set of activities that has to be planned by several autonomous agents. In general, due to the possible dependencies between the agents’ activities or interactions during execution of those activities, allowing agents to plan individually may lead to a very inefficient or even infeasible solution to...