Guaranteed‐performance consensus for nonlinear singular multiagent systems with directed topologies

2022 ◽  
Author(s):  
PengNan Wang ◽  
Lin Li ◽  
HongPing Niu
2020 ◽  
Vol 34 (23) ◽  
pp. 2050240
Author(s):  
Xiao-Wen Zhao ◽  
Guangsong Han ◽  
Qiang Lai ◽  
Dandan Yue

The multiconsensus problem of first-order multiagent systems with directed topologies is studied. A novel consensus problem is introduced in multiagent systems — multiconsensus. The states of multiple agents in each subnetwork asymptotically converge to an individual consistent value in the presence of information exchanges among subnetworks. Linear multiconsensus protocols are proposed to solve the multiconsensus problem, and the matrix corresponding to the protocol is designed. Necessary and sufficient conditions are derived based on matrix theory, under which the stationary multiconsensus and dynamic multiconsensus can be reached. Simulations are provided to demonstrate the effectiveness of the theoretical results.


2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Bo Liu ◽  
Li Wang ◽  
Dehui Sun ◽  
Xinmao Zhu

This paper investigates the consensus problem of multiagent systems with directed topologies. Different from the literatures, a new method, the Laplace transform, to study the consensus of multiagent systems with directed topology and communication time delay is proposed. The accurate state of the consensus center and the upper bound of the communication delay to make the agents reach consensus are given. It is proved that all the agents could aggregate and eventually form a cohesive cluster in finite time under certain conditions, and the consensus center is only determined by the initial states and the communication configuration among the agents. Finally, simulations are given to illustrate the theoretical results.


2013 ◽  
Vol 11 (6) ◽  
pp. 1122-1127 ◽  
Author(s):  
Guang-Song Han ◽  
Zhi-Hong Guan ◽  
Xin-Ming Cheng ◽  
Yonghong Wu ◽  
Feng Liu

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Dinh Hoa Nguyen

This paper proposes a novel approach to design fully distributed consensus controllers for heterogeneous linear Multiagent Systems subjected to randomly switching directed topologies and model uncertainties. The appealing features of this approach are as follows. First, it uses the mildest assumption for the randomly switching topologies that the union of switched graphs has a spanning tree. Second, the consensus is achieved under a class of state multiplicative uncertainties. Moreover, the proposed consensus controllers are low-rank and have nonconservative coupling strengths. Finally, a numerical example is presented to illustrate the effectiveness of the proposed theoretical approach.


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.


Sign in / Sign up

Export Citation Format

Share Document