Decentralized H∞ consensus protocol for a class of high-order multiagent systems

2016 ◽  
Vol 26 (15) ◽  
pp. 3330-3343 ◽  
Author(s):  
Hamed Rezaee ◽  
Farzaneh Abdollahi
2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Huayong Zhu ◽  
Yirui Cong ◽  
Xiangke Wang ◽  
Daibing Zhang ◽  
Qingjie Zhang

For the consensus problems of high-order linear multiagent systems with time-varying delays in directed topologies, the LMI based-consensus criterion and NLMI-based consensusabilization (protocol parameters design that makes the multiagent systems achieve consensus) are investigated. Improved Lyapunov-Krasovskii functional is used for establishing the consensus convergence criteria and deriving the corresponding consensus protocol. In order to reduce the conservativeness, some proper free-weighting matrices are added into the derivative of Lyapunov-Krasovskii functional and that only keeps one necessary zoom. The numerical and simulation examples are given to demonstrate the effectiveness of the theoretical results. Compared with existing literatures, the convergence criterion and protocol design proposed have lower conservativeness.


2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Wei Qian ◽  
Lei Wang

This paper addresses the global consensus of nonlinear multiagent systems with asymmetrically coupled identical agents. By employing a Lyapunov function and graph theory, a sufficient condition is presented for the global exponential consensus of the multiagent system. The analytical result shows that, for a weakly connected communication graph, the algebraic connectivity of a redefined symmetric matrix associated with the directed graph is used to evaluate the global consensus of the multiagent system with nonlinear dynamics under the common linear consensus protocol. The presented condition is quite simple and easily verified, which can be effectively used to design consensus protocols of various weighted and directed communications. A numerical simulation is also given to show the effectiveness of the analytical result.


2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Yilong Yang ◽  
Zhijian Ji ◽  
Lei Tian ◽  
Huizi Ma ◽  
Qingyuan Qi

The bipartite consensus of high-order edge dynamics is investigated for coopetition multiagent systems, in which the cooperative and competitive relationships among agents are characterized by positive weight and negative weight, respectively. By mapping the initial graph to a line graph, the distributed control protocol is proposed for the strongly connected, digon sign-symmetric structurally balanced line graph; and then we give sufficient conditions for the third-order multi-gent system to achieve both the bipartite consensus of edge dynamics and the final value of bipartite consensus. By transforming the coefficients of characteristic polynomial from complex domain to real number domain, the sufficient conditions for the bipartite consensus of high-order edge dynamics are also proposed, and the final values of the high-order edge dynamics on multiagent systems are obtained.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xiaochu Wang ◽  
Kaichun Zhao ◽  
Zheng You ◽  
Lungui Zheng

In order to avoid a potential waste of energy during consensus controls in the case where there exist measurement uncertainties, a nonlinear protocol is proposed for multiagent systems under a fixed connected undirected communication topology and extended to both the cases with full and partial access a reference. Distributed estimators are utilized to help all agents agree on the understandings of the reference, even though there may be some agents which cannot access to the reference directly. An additional condition is also considered, where self-known configuration offsets are desired. Theoretical analyses of stability are given. Finally, simulations are performed, and results show that the proposed protocols can lead agents to achieve loose consensus and work effectively with less energy cost to keep the formation, which have illustrated the theoretical results.


Sign in / Sign up

Export Citation Format

Share Document