Leader–follower guaranteed-cost consensualization for high-order linear swarm systems with switching topologies

Xi, Jianxiang; Yang, Xiaogang; Yu, Zhiyong; Liu, Guangbin

doi:10.1016/j.jfranklin.2014.10.028

Cited by 19 publications

(7 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since lim t!þ∞ Vt ðÞ¼0, one has In the existing works [11][12][13][14][15][16][17][18][19][20], the guaranteed performance consensus problems for linear multi-agent systems have been studied. Theorem 1 gives a sufficient condition for nonlinear multi-agent system (Eq.…”

Section: Analysis Of Guaranteed Performance Consensusmentioning

confidence: 99%

“…By the constraint of the performance index, the consensus control can be seen as an optimal or suboptimal problem, and the control process is more affected by choosing appropriate control parameters. In existing literatures about the guaranteed performance consensus problem, such as [11][12][13][14][15], the dynamic characteristic of each agent in the multi-agent systems was linear. For the linear multi-agent systems, the state-space decomposition approach was widely used to decompose the consensus and disagreement dynamics of multi-agent system, and the disagreement dynamics is the key of guaranteed performance consensus control.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Guaranteed Performance Consensus for Multi-Agent Systems

Wang¹

2019

Multi-Agent Systems - Control Spectrum

View full text Add to dashboard Cite

The guaranteed performance of the consensus control for multi-agent systems with Lipschitz nonlinear dynamics and directed interaction topologies is investigated, where the directed interaction topology contains a spanning tree. By a special matrix transformation, guaranteed performance consensus problems are transferred into guaranteed performance stabilization problems. Then, the criterions of guaranteed performance consensus for nonlinear multi-agent systems with directed interaction topologies are obtained, and an upper bound of the introduced performance function is given. A numerical simulation is given to demonstrate the effectiveness of the proposed results. Finally, some possible topics about the guaranteed performance consensus problem for nonlinear multi-agent systems are proposed.

show abstract

Section: Analysis Of Guaranteed Performance Consensusmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Guaranteed Performance Consensus for Multi-Agent Systems

Wang¹

2019

Multi-Agent Systems - Control Spectrum

View full text Add to dashboard Cite

show abstract

“…Lemma 2 [28]: Consider the dynamical system (1). Suppose that the spectrum of Laplacian matrix of the directed graph with spanning tree is 12…”

Section: Examplementioning

confidence: 99%

“…Li et al studied the robust stability problem of linear multi-agent systems with observer type interactive protocols [9], and later developed an approach [10] to realize consensus using merely the local information, without knowing the global structure of the network topology. Xi et al devised a technique based on oblique decomposition of state space [11], and recently addressed the guaranteed cost control for consensus [12], which can be regarded as a suboptimal control problem for interconnected systems. Other relevant works are included in [13][14][15][16][17][18].…”

Section: Introductionmentioning

confidence: 99%

On non-consensus motions of dynamical linear multiagent systems

Cai

Deng

2018

Pramana - J Phys

View full text Add to dashboard Cite

The non-consensus problems of high order linear time-invariant dynamical homogeneous multi-agent systems are concerned. Based on the conditions of consensus achievement, the mechanisms that lead to non-consensus motions are analyzed. Besides, a comprehensive classification for diverse types of non-consensus phases in accordance to the different conditions is conducted, which is jointly depending on the self-dynamics of agents, the interactive protocol and the graph topology. A series of numerical examples are demonstrated to illustrate the theoretical analysis.

show abstract

“…Containment control essentially is a kind of tracking problem. Different from the consensus tracking problems discussed in [3][4][5][6][7][8], there can be more than one leaders in containment problem. Consensus tracking problem can regarded a special case of containment problem where only one leader exists.…”

Section: Introductionmentioning

confidence: 99%