Convergence rate of leader-following consensus of networks of discrete-time linear agents in noisy environments

Author(s):  
Long Cheng ◽  
Yunpeng Wang ◽  
Zeng-Guang Hou ◽  
Min Tan
2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Bingbing Xu ◽  
Lixin Gao ◽  
Yan Zhang ◽  
Xiaole Xu

We consider the leader-following consensus problem of discrete-time multiagent systems on a directed communication topology. Two types of distributed observer-based consensus protocols are considered to solve such a problem. The observers involved in the proposed protocols include full-order observer and reduced-order observer, which are used to reconstruct the state variables. Two algorithms are provided to construct the consensus protocols, which are based on the modified discrete-time algebraic Riccati equation and Sylvester equation. In light of graph and matrix theory, some consensus conditions are established. Finally, a numerical example is provided to illustrate the obtained result.


Author(s):  
Bilal J Karaki ◽  
Magdi S Mahmoud

Abstract This paper focuses on leader-following and leaderless consensus problems of discrete-time multiagent systems. A distributed observer-based consensus protocol is proposed to investigate the consensus problem for multiagent systems of general discrete-time linear dynamics. By means of the observer, the distributed control law of each agent is designed using local information to guarantee consensus, and the corresponding sufficient conditions are obtained by exploiting graph and control theory approach. A modified distributed event-triggered consensus protocol is designed to reduce communication congestion. Detailed analysis of the leaderless and the leader-following consensus is presented for both observer-based and full-information protocols. Finally, two simulation examples are provided to demonstrate the effectiveness and capabilities of the established theories.


Sign in / Sign up

Export Citation Format

Share Document