Consensus of Discrete-Time Second-Order Multiagent Systems Based on Infinite Products of General Stochastic Matrices

2013 ◽  
Vol 51 (4) ◽  
pp. 3274-3301 ◽  
Author(s):  
Yao Chen ◽  
Jinhu Lü ◽  
Xinghuo Yu ◽  
Zongli Lin
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Second Order ◽  
Stochastic Matrices ◽  
Infinite Products ◽  
General Stochastic

scholarly journals Consensus of Discrete Time Second-Order Multiagent Systems with Time Delay

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Wei Zhu
Keyword(s):  
Time Delay ◽  
Convergence Rate ◽  
Theoretical Result ◽  
Multiagent Systems ◽  
Discrete Time ◽  
Second Order ◽  
Sufficient Condition ◽  
Consensus Problem ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient

The consensus problem for discrete time second-order multiagent systems with time delay is studied. Some effective methods are presented to deal with consensus problems in discrete time multiagent systems. A necessary and sufficient condition is established to ensure consensus. The convergence rate for reaching consensus is also estimated. It is shown that arbitrary bounded time delay can safely be tolerated. An example is presented to illustrate the theoretical result.

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.

Sign in / Sign up

Export Citation Format

Share Document