Consensus of Data-Sampled Multi-Agent Systems With Random Communication Delay and Packet Loss
IEEE Transactions on Automatic ControlPublished 11 February 2010
Ya Zhang, Yu‐Ping Tian
Citations256
SJR quartileQ1
SJR score3.80
SNIP2.59
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An approach to designing consensus protocol is proposed and numerical examples are given to illustrate the results.
Abstract
The consensus problem is considered for a team of second-order mobile agents communicating via a network with noise, variable delays and occasional packet losses. A queuing mechanism is applied and the switching process of the interaction topology of the network is modeled as a Bernoulli random process. In such a framework, a necessary and sufficient condition is presented for the mean-square robust consensus. Moreover, a necessary and sufficient condition of the solvability of the mean-square robust consensus problem is established. An approach to designing consensus protocol is proposed and numerical examples are given to illustrate the results.
Keywords
Computer Science
IEEE Transactions on Automatic ControlConsensus Problems in Networks of Agents With Switching Topology and Time-Delays
12,721 Citations2004Reza Olfati‐Saber, Richard M. Murray
A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
IEEE Transactions on Automatic ControlCoordination of groups of mobile autonomous agents using nearest neighbor rules
8,330 Citations2003Ali Jadbabaie, Jie Lin +1 more
IEEE Transactions on Automatic ControlConsensus seeking in multiagent systems under dynamically changing interaction topologies
6,542 Citations2005Wei Ren, Randal W. Beard
It is shown that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.
IEEE Transactions on Automatic ControlStability of multiagent systems with time-dependent communication links
2,710 Citations2005Luc Moreau
It is observed that more communication does not necessarily lead to faster convergence and may eventually even lead to a loss of convergence, even for the simple models discussed in the present paper.
IEEE Transactions on Automatic ControlFlocking in Fixed and Switching Networks
1,421 Citations2007Herbert G. Tanner, Ali Jadbabaie +1 more
This note analyzes the stability properties of a group of mobile agents that align their velocity vectors, and stabilize their inter-agent distances, using decentralized, nearest-neighbor interaction rules, exchanging information over networks that change arbitrarily.
AutomaticaDistributed observers design for leader-following control of multi-agent networks
1,116 Citations2007Yiguang Hong, Guanrong Chen +1 more
It is proved that each agent can follow the active leader of a multi-agent system with a switching interconnection topology with an explicitly constructed common Lyapunov function (CLF).
Journal of Parallel and Distributed ComputingDistributed average consensus with least-mean-square deviation
1,109 Citations2006Lin Xiao, Stephen Boyd +1 more
The problem of finding the (symmetric) edge weights that result in the least mean-square deviation in steady state is considered and it is shown that this problem can be cast as a convex optimization problem, so the global solution can be found efficiently.
Physica A Statistical Mechanics and its ApplicationsLeader-following coordination of multi-agent systems with coupling time delays
941 Citations2006Jiangping Hu, Yiguang Hong
A leader-following consensus problem of a group of autonomous agents with time-varying coupling delays with a necessary and sufficient condition in the case when the interconnection topology is fixed and directed.
IEEE Transactions on Automatic ControlA new method for stabilization of networked control systems with random delays
859 Citations2005Liqian Zhang, Yang Shi +2 more
This work considers the stabilization problem for a kind of networked control systems in discrete-time domain with random delays, and it is shown that the state-feedback gains are different with different modes.
IEEE Transactions on Automatic ControlAsynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
742 Citations2008Feng Xiao, Long Wang
The main contribution of this paper is to provide a valid distributed consensus algorithm that overcomes the difficulties caused by unreliable communication channels, such as intermittent information transmission, switching communication topology, and time-varying communication delays, and therefore has its obvious practical applications.
IEEE Transactions on Automatic ControlConsensus of Multi-Agent Systems With Diverse Input and Communication Delays
588 Citations2008Yu‐Ping Tian, Cheng‐Lin Liu
The consensus problem for multi-agent systems with input and communication delays is studied based on the frequency-domain analysis and two decentralized consensus conditions are obtained.
SIAM Journal on Control and OptimizationReaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
575 Citations2008Ming Cao, A. Stephen Morse +1 more
Graph-theoretic conditions are obtained which address the convergence question for the leaderless version of the widely studied Vicsek consensus problem.
2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)Agreement over random networks
568 Citations2004Naomichi Hatano, Mehran Mesbahi
IEEE Transactions on Automatic ControlAgreement over random networks
497 Citations2005Naomichi Hatano, Mehran Mesbahi
In a random network, the existence of an information channel between a pair of elements at each time instance is probabilistic and independent of other channels; hence, the topology of the network varies over time.
IEEE Transactions on Automatic ControlA Necessary and Sufficient Condition for Consensus Over Random Networks
428 Citations2008Alireza Tahbaz-Salehi, Ali Jadbabaie
A necessary and sufficient condition for almost sure asymptotic consensus using simple ergodicity and probabilistic arguments is presented and this easily verifiable condition uses the spectrum of the average weight matrix.
SIAM Journal on Control and OptimizationReaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
333 Citations2008Ming Cao, A. Stephen Morse +1 more
IEEE Transactions on Automatic ControlConsensus Seeking Over Random Weighted Directed Graphs
303 Citations2007Maurizio Porfiri, Daniel J. Stilwell
This work examines the consensus problem for a group of agents that communicate via a stochastic information network that is modeled as a weighted directed random graph that switches periodically.
AutomaticaRobust consensus of multi-agent systems with diverse input delays and asymmetric interconnection perturbations
261 Citations2009Yu‐Ping Tian, Cheng‐Lin Liu
The consensus problem of second-order multi-agent systems with diverse input delays is investigated, and a bound of the largest singular value of the perturbation matrix is obtained as the robust consensus condition.
International Journal of ControlClosed-loop control of systems over a communications network with queues
165 Citations1995H. Chan, Ümi̇t Özgüner
A state prediction/control scheme to control closed loop control through a communication network that uses knowledge of the amount of data in the queue to enhance prediction and demonstrate the performance of the proposed scheme.
Proceedings of the ... American Control Conference/Proceedings of the American Control ConferenceSecond-order Consensus Algorithm with Extensions to Switching Topologies and Reference Models
105 Citations2007Wei Ren
This paper shows sufficient conditions under which consensus is reached under switching directed information exchange topologies and proposes consensus algorithms so that the information variables of each vehicle approach the solution of a nonlinear reference model when only a portion of the vehicles in the team have access to the model.
Distributed Consensus Control for Second-Order Agents with Fixed Topology and Time-Delay
103 Citations2006Peng Lin, Yingmin Jia +2 more
It is proved that the largest tolerable time-delay is only related to the largest eigenvalue of the graph Laplacian, which indicates that distributed consensus control for networks of agents with double integrator dynamics is feasible.
IEEE Transactions on Automatic ControlComments on “Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules”
74 Citations2007Dimitri P. Bertsekas, John N. Tsitsiklis