Containment control of continuous-time linear multi-agent systems with aperiodic sampling

Liu, Huiyang; Cheng, Long; Tan, Min; Hou, Zeng-Guang

doi:10.1016/j.automatica.2015.04.005

Cited by 140 publications

(49 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [13], Liu et al study the controllability for the leader-following MAS with the switch- 20 ing topology, by the aid of the new theoretical results in studying the switched control systems, while Rahmani et al investigate this problem from the perspective of graph-theoretic in [14]. Then, it was validated that all followers will follow the leader asymptotically if they are directly or indirectly linked to their leader at an appropriate frequency [15].…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Leader-following consensus of multi-agent system with a smart leader

Liu

Chen

2016

Neurocomputing

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 98%

“…In addition, Wang and Cheng [19] study the containment problem for the first-order and second-order multi-agent system with communication noises, assuming the existence of multiple leaders. For more details, the readers can refer to [20,21,22,23,24].…”

Section: Introductionmentioning

confidence: 99%

Leader-following consensus of multi-agent system with a smart leader

Liu

Chen

2016

Neurocomputing

View full text Add to dashboard Cite

“…A directed forest is a directed graph including one or more directed trees where any two of them have no node in common. A directed spanning forest is a directed forest, which consists of all the vertices and some edges in graph . For a group of N + M agents, if an agent has no neighbor, the agent is called a leader; otherwise, it is a follower.…”

Section: Introductionmentioning

confidence: 99%

Containment control for distributed networks subject to multiplicative and additive noises with stochastic approximation–type protocols

Wang

Zuo

et al. 2019

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

Summary This paper is concerned with the stochastic containment control problem for distributed network with multiplicative and additive noises, in which the stochastic approximation technique is utilized. A major challenge, compared with the existing results with multiplicative and additive noises, is that the involving leaders are dynamically changing. It is shown that finite boundedness for dynamical leaders is of great importance for addressing the stochastic containment control issue. A suitable approach is proposed to handle multiplicative and additive noises based on the stochastic approximation, and some necessary/sufficient conditions are derived for mean square convergence with mild requirements. Furthermore, the convergence rates are studied for both dynamical leaders and static leaders scenarios. We conclude this paper by using two illustrative examples to verify the effectiveness of the theoretical results.

show abstract

“…Moreover, the cases of stationary and dynamic leaders were discussed. In , Liu et al. proposed an aperiodic sampled‐data protocol.…”

Section: Introductionmentioning

confidence: 99%

Consensus analysis for leader‐following multi‐agent systems with second‐order individual dynamics and arbitrary sampling

Dai

Xiao

Wei

2017

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

Summary This paper performs a consensus analysis of leader‐following multi‐agent systems with multiple double integrators in the framework of sampled‐data control. Both single‐leader and multiple‐leader scenarios are considered under the assumption of networks with detectable position‐like state information. The coordination tasks are accomplished by a given protocol with the robustness against the change of sampling periods. The sampling periods can be chosen to be of an arbitrary fixed length or large time‐varying length. Under the proposed protocol, we achieve two objectives: (i) in the single leader‐subgroup case, all followers reach an agreement with leaders on states asymptotically and (ii) in the multiple leader‐subgroup case, each follower converges to some convex combination of the final states of all leaders. It is shown that the final state configuration of the convex combination is uniquely determined by the underlying interaction topology, which can be any weakly connected graph. Compared with the existing results on leader‐following networks, the consensus problem and the containment problem are solved in a unified framework with large sampling periods. Some numerical experiments are conducted to illustrate the dynamic behavior of all agents with this protocol. Copyright © 2017 John Wiley & Sons, Ltd.

show abstract

Containment control of continuous-time linear multi-agent systems with aperiodic sampling

Cited by 140 publications

References 32 publications

Leader-following consensus of multi-agent system with a smart leader

Leader-following consensus of multi-agent system with a smart leader

Containment control for distributed networks subject to multiplicative and additive noises with stochastic approximation–type protocols

Consensus analysis for leader‐following multi‐agent systems with second‐order individual dynamics and arbitrary sampling

Contact Info

Product

Resources

About