Related papers: Distributed Adaptive Consensus Protocols for Linea…
This paper addresses the problem of fixed-time cooperative output regulation for linear multi-agent systems over directed graphs under denial-of-service attacks. A novel distributed resilient fixed-time controller is developed that…
In this paper, we study a distributed parameter estimation problem with an asynchronous communication protocol over multi-agent systems. Different from traditional time-driven communication schemes, in this work, data can be transmitted…
This paper studies the consensus problem of multi-agent systems with asymmetric and reducible topologies. Centralized event-triggered rules are provided so as to reduce the frequency of system's updating. The diffusion coupling feedbacks of…
This paper proposes a novel distributed event-triggered algorithmic solution to the multi-agent average consensus problem for networks whose communication topology is described by weight-balanced, strongly connected digraphs. The proposed…
This paper discusses distributed optimization over a directed graph. We begin with some well known algorithms which achieve consensus among agents including FROST [1], which possesses the quickest convergence to the optimum. It is a well…
We study a multi-agent output regulation problem, where not all agents have access to the exosystem's dynamics. We propose a fully distributed controller that solves the problem for linear, heterogeneous, and uncertain agent dynamics as…
Adaptive networks consist of a collection of nodes with adaptation and learning abilities. The nodes interact with each other on a local level and diffuse information across the network to solve estimation and inference tasks in a…
Distributed linear algebraic equation over networks, where nodes hold a part of problem data and cooperatively solve the equation via node-to-node communications, is a basic distributed computation task receiving an increasing research…
This article considers consensus problem of multiagent systems with double integrator dynamics under nonuniform sampling. It is considered the maximum sampling time can be selected arbitrarily. Moreover, the communication graph can change…
Natural, social, and artificial multi-agent systems usually operate in dynamic environments, where the ability to respond to changing circumstances is a crucial feature. An effective collective response requires suitable information…
A solution is provided in this note for the adaptive consensus problem of nonlinear multi-agent systems with unknown and non-identical control directions assuming a strongly connected underlying graph topology. This is achieved with the…
This paper investigates a robust positive consensus problem for a class of heterogeneous high-order multi-agent systems subject to external inputs. Compared with existing multi-agent consensus results, the most distinct feature of the…
This two-part paper discusses robustification methodologies for linear-iterative distributed algorithms for consensus and coordination problems in multicomponent systems, in which unreliable communication links may drop packets. We consider…
In this paper, we first present an adaptive distributed observer for a discrete-time leader system. This adaptive distributed observer will provide, to each follower, not only the estimation of the leader's signal, but also the estimation…
This paper considers the consensusability of multi-agent systems with delay and packet dropout. By proposing a kind of predictor-like protocol, sufficient and necessary conditions are given for the mean-square consensusability in terms of…
Coordinating multiple autonomous agents to reach a target region while avoiding collisions and maintaining communication connectivity is a core problem in multi-agent systems. In practice, agents have a limited communication range. Thus,…
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…
We study resilient leader-follower consensus of multi-agent systems (MASs) in the presence of adversarial agents, where agents' communication is modeled by time-varying topologies. The objective is to develop distributed algorithms for the…
This paper is devoted to distributed continuous-time and discrete-time optimization problems with nonuniform convex constraint sets and nonuniform stepsizes for general differentiable convex objective functions. The communication graphs are…
In this paper we consider a network of processors aiming at cooperatively solving linear programming problems subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…