scholarly journals Consensusabilization for Continuous-Time High-Order Multiagent Systems with Time-Varying Delays

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-8 ◽  
Author(s):  
Hong Xia ◽  
Ting-Zhu Huang ◽  
Jin-Liang Shao ◽  
Jun-Yan Yu

A formation control problem for second-order multiagent systems with time-varying delays is considered. First, a leader-following consensus protocol is proposed for theoretical preparation. With the help of Lyapunov-Krasovskii functional, a sufficient condition under this protocol is derived for stability of the multiagent systems. Then, the protocol is extended to the formation control based on a multiple leaders’ architecture. It is shown that the agents will attain the expected formation. Finally, some simulations are provided to demonstrate the effectiveness of our theoretical results.


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.


2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Haiying Ma ◽  
Xiao Jia ◽  
Ning Cai ◽  
Jianxiang Xi

In this paper, adaptive guaranteed-performance consensus control problems for multiagent systems with an adjustable convergence speed are investigated. A novel adaptive guaranteed-performance consensus protocol is proposed, where the communication weights can be adaptively regulated. By the state space decomposition method and the stability theory, sufficient conditions for guaranteed-performance consensus are obtained and the guaranteed-performance cost is determined. Moreover, the lower bound of the convergence coefficient for multiagent systems is deduced, which is linearly adjustable approximately by changing the adaptive control gain. Finally, simulation examples are introduced to demonstrate theoretical results.


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.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-14 ◽  
Author(s):  
Xiaoyu Wang ◽  
Kaien Liu ◽  
Zhijian Ji ◽  
Shitao Han

In this paper, the bipartite consensus problem of heterogeneous multiagent systems composed of first-order and second-order agents is considered by utilizing the event-triggered control scheme. Under structurally balanced directed topology, event-triggered bipartite consensus protocol is put forward, and event-triggering functions consisting of measurement error and threshold are designed. To exclude Zeno behavior, an exponential function is introduced in the threshold. The bipartite consensus problem is transformed into the corresponding stability problem by means of gauge transformation and model transformation. By virtue of Lyapunov method, sufficient conditions for systems without input delay are obtained to guarantee bipartite consensus. Furthermore, for the case with input delay, sufficient conditions which include an admissible upper bound of the delay are obtained to guarantee bipartite consensus. Finally, numerical simulations are provided to illustrate the effectiveness of the obtained theoretical results.


Author(s):  
Fang Wang ◽  
◽  
Xin Chen ◽  
Yong He ◽  

The finite-time consensus problem for double-integrator multi-agent systems (MASs) is studied using time-varying directed topologies. In detail, a distributed finite-time control protocol is designed to achieve the weighted average consensus on the basis of both relative position and relative velocity measurements by utilizing a homogeneous control technique. Then, on the basis of graph theory, homogeneity with dilation and LaSalle’s invariance principle, the designed finite-time consensus protocol ensures finite-time convergence to a consensus in the time-varying directed topologies without a global leader. Finally, some examples and simulation results are given to illustrate the effectiveness of the obtained 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.


2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Fangcui Jiang

This paper focuses on the consensus problem for high-order multiagent systems (MAS) with directed network and asymmetric time-varying time-delays. It is proved that the high-order multiagent system can reach consensus when the network topology contains a spanning tree and time-delay is bounded. The main contribution of this paper is that a Lyapunov-like design framework for the explicit selection of protocol parameters is provided. The Lyapunov-like design guarantees the robust consensus of the high-order multiagent system with respect to asymmetric time-delays and is independent of the exact knowledge of the topology when the communication linkages among agents are undirected and connected.


Sign in / Sign up

Export Citation Format

Share Document