Related papers: Leader Selection in Multi-Agent Networks with Swit…
We investigate the problem of optimally observing a finite set of targets using a mobile agent over an infinite time horizon. The agent is tasked to move in a network-constrained structure to gather information so as to minimize the…
Identifying the most influential driver nodes to guarantee the fastest synchronization speed is a key topic in pinning control of multi-agent systems. This paper develops a methodology to find the most influential pinning nodes under…
In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a…
Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…
Networked systems are systems of interconnected components, in which the dynamics of each component are influenced by the behavior of neighboring components. Examples of networked systems include biological networks, critical…
In this paper, we investigate distributed multi-agent tracking of a convex set specified by multiple moving leaders with unmeasurable velocities. Various jointly-connected interaction topologies of the follower agents with uncertainties are…
Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…
This paper addresses the finite-time non-overshooting leader-following consensus problem for multi-agent systems, whose agents are modeled by a dynamical system topologically equivalent to the integrator chain. Based on the weighted…
A distributed adaptive control strategy is developed for heterogeneous multiagent systems in nonlinear Brunovsky form with \({\pd}\)-dimensional $n^{\text{th}}$-order dynamics, operating under time-triggered switching communication…
We study the performance of a network of agents tasked with tracking an external unknown signal in the presence of stochastic disturbances and under the condition that only a limited subset of agents, known as leaders, can measure the…
This note investigates how to design topology structures to ensure the controllability of multi-agent networks (MASs) under any selection of leaders. We put forward a concept of perfect controllability, which means that a multi-agent system…
We study minimum-variance feedback-control design for a networked control system with retarded dynamics, where inter-agent communication is subject to latency. We prove that such a design can be solved efficiently for circular formations…
In this paper, we propose a discontinuous distributed model-independent algorithm for a directed network of Euler-Lagrange agents to track the trajectory of a leader with non-constant velocity. We initially study a fixed network and show…
Composite systems are large complex systems con- sisting of interconnected agents (subsystems). Agents in a com- posite system interact with each other towards performing an in- tended goal. Controllability is essential to achieve desired…
This paper focuses on the multi-agent synchronization problem with an open-loop unstable leader and followers under the switching topologies. For this issue, the typical approach is intermittent communication (including a spanning tree…
This paper is concerned with a leader-follower problem for a multi-agent system with a switching interconnection topology. Distributed observers are designed for the second-order follower-agents, under the common assumption that the…
Submodular optimization is a special class of combinatorial optimization arising in several machine learning problems, but also in cooperative control of complex systems. In this paper, we consider agents in an asynchronous, unreliable and…
We propose a protocol to solve Leader Election within weak communication models such as the beeping model or the stone-age model. Unlike most previous work, our algorithm operates on only six states, does not require unique identifiers, and…
We consider leader-follower multi-agent systems that have many leaders, defined on any connected weighted undirected graphs, and address the leader selection and demotion problems. The leader selection problem is formulated as a…
Networks are fundamental models for data used in practically every application domain. In most instances, several implicit or explicit choices about the network definition impact the translation of underlying data to a network…