scholarly journals Average Consensus in Multiagent Systems with the Problem of Packet Losses When Using the Second-Order Neighbors’ Information

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Mei Yu ◽  
Lijuan Li ◽  
Guangming Xie ◽  
Hong Shi
Keyword(s):  
Multiagent Systems ◽  
Second Order ◽  
Communication Link ◽  
Sampled Data ◽  
Bernoulli Process ◽  
Packet Losses ◽  
First Order ◽  
Data Framework ◽  
Average Consensus ◽  
Distributed Average Consensus

This paper mainly investigates the average consensus of multiagent systems with the problem of packet losses when both the first-order neighbors’ information and the second-order neighbors’ information are used. The problem is formulated under the sampled-data framework by discretizing the first-order agent dynamics with a zero-order hold. The communication graph is undirected and the loss of data across each communication link occurs at certain probability, which is governed by a Bernoulli process. It is found that the distributed average consensus speeds up by using the second-order neighbors’ information when packets are lost. Numerical examples are given to demonstrate the effectiveness of the proposed methods.

scholarly journals Event-Triggered Control for Multiagent Systems with the Problem of Packet Losses and Communication Delays When Using the Second-Order Neighbors’ Information

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Chuan Yan ◽  
Mei Yu ◽  
Guangming Xie ◽  
Yu Liu
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Second Order ◽  
Communication Link ◽  
Communication Delays ◽  
Sampled Data ◽  
Packet Losses ◽  
Control Laws ◽  
Data Framework ◽  
Event Triggered

This paper mainly investigates the event-triggered control for discrete-time multiagent systems with the problem of packet losses and communication delays when both the first-order and the second-order neighbors’ information are used. Event-triggered control laws are adopted so as to reduce the frequency of individual actuation updating under the sampled-data framework for discrete-time agent dynamics. The communication graph is undirected and the loss of data across each communication link occurs at certain probability, which is governed by a Bernoulli process. It is found that the distributed consensus speeds up by using the second-order neighbors’ information when packet losses and communication delays occur. Numerical examples are given to demonstrate the effectiveness of the proposed methods.

scholarly journals Consensus Analysis of Second-Order Multi-Agent Networks With Sampled Data and Packet Losses

IEEE Access ◽  
2016 ◽  
Vol 4 ◽  
pp. 8127-8137 ◽  
Author(s):  
Wenxia Cui ◽  
Yang Tang ◽  
Jian-An Fang ◽  
Jurgen Kurths
Keyword(s):  
Second Order ◽  
Sampled Data ◽  
Packet Losses ◽  
Consensus Analysis ◽  
Multi Agent ◽  
Agent Networks

scholarly journals Sampled-Data Consensus for High-Order Multiagent Systems under Fixed and Randomly Switching Topology

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Niu Jie ◽  
Li Zhong
Keyword(s):  
Multiagent Systems ◽  
Linear Time ◽  
Sampling Period ◽  
Switching Topology ◽  
Sampled Data ◽  
System Matrix ◽  
Packet Losses ◽  
Linear Time Invariant ◽  
Switching Topologies ◽  
Necessary And Sufficient

This paper studies the sampled-data based consensus of multiagent system with general linear time-invariant dynamics. It focuses on looking for a maximum allowable sampling period bound such that as long as the sampling period is less than this bound, there always exist linear consensus protocols solving the consensus problem. Both fixed and randomly switching topologies are considered. For systems under fixed topology, a necessary and sufficient sampling period bound is obtained for single-input multiagent systems, and a sufficient allowable bound is proposed for multi-input systems by solving theH∞optimal control problem of certain system with uncertainty. For systems under randomly switching topologies, tree-type and complete broadcasting network with Bernoulli packet losses are discussed, and explicit allowable sampling period bounds are, respectively, given based on the unstable eigenvalues of agent’s system matrix and packet loss probability. Numerical examples are given to illustrate the results.

scholarly journals Consensus Conditions for High-Order Multiagent Systems with Nonuniform Delays

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Mengji Shi ◽  
Kaiyu Qin ◽  
Ping Li ◽  
Jun Liu
Keyword(s):  
Multiagent Systems ◽  
Time Delays ◽  
Second Order ◽  
High Order ◽  
Sixth Order ◽  
Multiple Time ◽  
State Variables ◽  
Third Order ◽  
First Order ◽  
The Third

Consensus of first-order and second-order multiagent systems has been wildly studied. However, the convergence of high-order (especially the third-order to the sixth-order) state variables is also ubiquitous in various fields. The paper handles consensus problems of high-order multiagent systems in the presence of multiple time delays. Obtained by a novel frequency domain approach which properly resolves the challenges associated with nonuniform time delays, the consensus conditions for the first-order and second-order systems are proven to be nonconservative, and those for the third-order to the sixth-order systems are provided in the form of simple inequalities. The method revealed in this article is applicable to arbitrary-order systems, and the results are less conservative than those based on Lyapunov approaches, because it roots in sufficient and necessary criteria of stabilities. Simulations are carried out to validate the theoretical results.

Sign in / Sign up

Export Citation Format

Share Document