scholarly journals On Distributed Reduced-Order Observer-Based Protocol for Linear Multiagent Consensus under Switching Topology

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Yan Zhang ◽  
Lixin Gao ◽  
Changfei Tong
Keyword(s):  
Switching Topology ◽  
Consensus Problem ◽  
Common Lyapunov Function ◽  
Reduced Order ◽  
Reduced Order Observer ◽  
Leader Following ◽  
Multi Agent ◽  
Fixed Topology ◽  
Parameter Dependent ◽  
The Given

We discuss linear multiagent systems consensus problem with distributed reduced-order observer-based protocol under switching topology. We use Jordan decomposition method to prove that the proposed protocols can solve consensus problem under directed fixed topology. By constructing a parameter-dependent common Lyapunov function, we prove that the distributed reduced-order observer-based protocol can also solve the continuous-time multi-agent consensus problem under the undirected switching interconnection topology. Then, we investigate the leader-following consensus problem and propose a reduced-order observer-based protocol for each following agent. By using similar analysis method, we can prove that all following agents can track the leader under a class of directed interaction topologies. Finally, the given simulation example also shows the effectiveness of our obtained result.

Distributed H∞ Control for Leader-Following Coordination with Switching Topology

2011 ◽  
Vol 135-136 ◽  
pp. 455-463
Author(s):  
Yan Ping Luo ◽  
Li Xin Gao
Keyword(s):  
Control Problem ◽  
External Disturbance ◽  
Switching Topology ◽  
Consensus Control ◽  
Common Lyapunov Function ◽  
Control Laws ◽  
Leader Following ◽  
Multi Agent ◽  
Feedback Laws ◽  
Parameter Dependent

In this paper, we consider multi-agent H∞consensus control problems with external disturbance under the undirected switching topologies. The agent dynamics is expressed in the form of a second-order model and the control laws are neighbor-based feedback laws. By using the model transformation, the multi-agent H∞consensus control problem is converted into H∞ control problem for a switching linear system with special structure. A sufficient condition is established under which all agents can reach consensus with the desired H∞performance in switching topology case by constructing a parameter-dependent common Lyapunov function. Moreover, we give an explicit estimation expression to estimate H∞ performance index. Finally, a numerical example is provided to illustrate the effectiveness of our results.

scholarly journals Distributed Adaptive Formation Tracking Control under Fixed and Switching Topologies: Application on General Linear Multi-Agent Systems

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 941
Author(s):  
Tianhao Sun ◽  
Huiying Liu ◽  
Yongming Yao ◽  
Tianyu Li ◽  
Zhibo Cheng
Keyword(s):  
Switching Topology ◽  
General Linear ◽  
Time Varying ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Agent System ◽  
Switching Topologies ◽  
Formation Tracking ◽  
Leader Following ◽  
Multi Agent

In this paper, the time-varying formation tracking problem of the general linear multi-agent system is discussed. A distributed formation tracking protocol based on Riccati inequalities with adaptive coupling weights among the follower agents and the leader agent is designed for a leader-following multi-agent system under fixed and switching topologies. The formation configuration involved in this paper is expressed as a bounded piecewise continuously differentiable vector function. The follower agents will achieve the desired formation tracking trajectory of the leader. In traditional static protocols, the coupling weights depend on the communication topology and is a constant. However, in this paper, the coupling weights are updated by the state errors among the neighboring agents. Moreover, the stability analysis of the MAS under switching topology is presented, and proves that the followers also could achieve pre-specified time-varying formation, if the communication graph is jointly connected. Two numerical simulations indicate the capabilities of the algorithms.

scholarly journals Impulsive Consensus for Leader-Following Multiagent Systems with Fixed and Switching Topology

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Zhi-Wei Liu ◽  
Zhi-Hong Guan ◽  
Hong Zhou
Keyword(s):  
Multiagent System ◽  
Impulsive Control ◽  
Sampling Period ◽  
Switching Topology ◽  
Sufficient Condition ◽  
Leader Following ◽  
Fixed Topology ◽  
The Stability ◽  
Sampling Instant ◽  
Necessary And Sufficient

This paper studied the consensus problem of the leader-following multiagent system. It is assumed that the state information of the leader is only available to a subset of followers, while the communication among agents occurs at sampling instant. To achieve leader-following consensus, a class of distributed impulsive control based on sampling information is proposed. By using the stability theory of impulsive systems, algebraic graph theory, and stochastic matrices theory, a necessary and sufficient condition for fixed topology and sufficient condition for switching topology are obtained to guarantee the leader-following consensus of the multiagent system. It is found that leader-following consensus is critically dependent on the sampling period, control gains, and interaction graph. Finally, two numerical examples are given to illustrate the effectiveness of the proposed approach and the correctness of theoretical analysis.

Leader-following consensus of heterogeneous linear multi-agent systems: New results based on linear transformation method

2021 ◽  
pp. 014233122110582
Author(s):  
Yangzhou Chen ◽  
Guangyue Xu ◽  
Jingyuan Zhan
Keyword(s):  
Linear Transformation ◽  
Design Method ◽  
Transformation Method ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Agent Systems ◽  
Hurwitz Stability ◽  
Leader Following ◽  
Multi Agent

This paper studies the leader-following state consensus problem for heterogeneous linear multi-agent systems under fixed directed communication topologies. First, we propose a consensus protocol consisting of four parts for high-order multi-agent systems, in which different agents are allowed to have different gain matrices so as to increase the degree of design freedom. Then, we adopt a state linear transformation, which is constructed based on the incidence matrix of a directed spanning tree of the communication topology, to equivalently transform the state consensus problem into a partial variable stability problem. Meanwhile, the results of the partial variable stability theory are used to derive a sufficient and necessary consensus criterion, expressed as the Hurwitz stability of a real matrix. Then, this criterion is further expressed as a bilinear matrix inequality condition, and, based on this condition, an iterative algorithm is proposed to find the gain matrices of the protocol. Finally, numerical examples are provided to verify the effectiveness of the proposed protocol design method.

Sign in / Sign up

Export Citation Format

Share Document