Distributed containment control of multi‐agent systems under asynchronous switching and stochastic disturbances

Liu, Quanli; Zhou, Tuo; Guo, Shixin; Wang, Zehua; Wang, Dong; Wang, Wei

doi:10.1049/iet-cta.2018.6202

Cited by 9 publications

(4 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Remark 3: Similar assumption for the containment control problems of general nonlinear dynamics is also used in [6], [25]. All linear and some nonlinear functions such as c cos t + v sin t and xe −t satisfy the condition above in Assumption 5.…”

Section: B Non-fragile Containment Control Of Inherent Nonlinear Masmentioning

confidence: 99%

See 1 more Smart Citation

Non-Fragile Disturbance Observer-Based Containment Control of Multi-Agent Systems Over Switching Topologies

Zhou¹,

Liu

Wang

2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

In this paper, the non-fragile containment control problem for linear multi-agent systems (MASs) with exogenous disturbance is investigated. The communication links among agents are constructed by a set of arbitrarily fast switching and directed topologies. First, there always exist uncertainties in the controller and observer gain matrices, a new class of distributed non-fragile disturbance observer-based controller is proposed to address such a problem with disturbance rejection under switching topologies. By making use of matrix transformation and Lyapunov theory, the containment control problem of MASs is converted into the asymptotic stability analysis problem of some containment error dynamics. Second, the corresponding non-fragile containment control problem of inherent nonlinear case with exogenous disturbance under switching topologies is further studied. Finally, two simulation examples are given to investigate the effectiveness of the proposed control strategy.INDEX TERMS Non-fragile containment control, multi-agent systems, switching topologies, disturbance rejection, nonlinear dynamics.

show abstract

Section: B Non-fragile Containment Control Of Inherent Nonlinear Masmentioning

confidence: 99%

“…Cooperation control has received growing attraction in the past decade due to its wide applications, see [1]- [6] and the references therein. Consensus problem, where a set of agents are required to agree on certain quantities of interest, has been extensively researched and applied to many important academic fields.…”

Section: Introductionmentioning

confidence: 99%

Non-Fragile Disturbance Observer-Based Containment Control of Multi-Agent Systems Over Switching Topologies

Zhou¹,

Liu

Wang

2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since the influence of various disturbances on the stability of the system is very large, how to study and solve the effects of stochastic perturbations has become an interesting and important topic. Up to now, some basic work about the problem of consensus with stochastic disturbances has been discussed in [21,22]. As far as we know, multi-agent system with stochastic disturbances and randomly occurring nonlinearities are rarely considered.…”

Section: Introductionmentioning

confidence: 99%

Consensus of multi-agent systems with randomly occurring nonlinearities via uncertain pinning control under switching topologies *

Sui,

Yang,

Wang

2023

Preprint

View full text Add to dashboard Cite

This paper is focused on the consensus problem of multi-agent systems via uncertain pinning control under switching topologies. The stochastic disturbances and randomly occurring nonlinearities are proposed to describe more realistic systems. The communication topology is modeled by a directed graph and it is divided into two cases, the consensus problem is discussed in these two cases. In addition, there exist some uncertain pinning connections between the followers and leader due to switching topologies, the distributed control protocol is designed to satisfy the follower asymptotically converge to the leader. By constructing suitable multiple Lyapunov functions and utilizing tools of M-matrix theory, some sufficient consensus criteria are deduced to reach this goal. Finally, two examples are given to verify the correctness of the proposed method.

show abstract

“…The sufficient conditions of stability analysis and the solution of protocol are given in the form of LMIs. In the work of [28], the issue of distributed containment control of MASs is studied. The asynchronous switching and stochastic disturbances are taken into consideration, in which it is supposed that the switching of controllers will lag behind the switching of system modes.…”

mentioning

confidence: 99%

$H_{\infty}$ Consensus Design and Online Scheduling for Multiagent Systems with Switching Topologies via Deep Reinforcement Learning

Cheng

Song

Xu³

et al. 2022

International Journal of Aerospace Engineering

View full text Add to dashboard Cite

This paper is devoted to H ∞ consensus design and online scheduling for homogeneous multiagent systems (MASs) with switching topologies via deep reinforcement learning. The model of homogeneous MASs with switching topologies is established based on switched systems theory, in which the switching of topologies is viewed as the switching among subsystems. By employing linear transformation, the closed-loop systems of MASs are converted into reduced-order systems. The problem of H ∞ consensus design can be transformed to the issue of H ∞ control. It is supposed that the consensus protocol is composed of two parts: dynamics-based protocol and learning-based protocol, where dynamics-based protocol is provided to guarantee the convergence and weighted attenuation and learning-based protocol is proposed to improve the transient performance. Then, the multiple Lyapunov function (MLF) method and mode-dependent average dwell time (MDADT) method are combined to ensure the stability and weighted H ∞ disturbance attenuation index of reduced-order systems. The sufficient existing conditions of dynamics-based protocol are given through the feasible solutions of linear matrix inequalities (LMIs). Moreover, the online scheduling is formulated as a Markov decision process, and the deep deterministic policy gradient (DDPG) algorithm in the framework of actor-critic is proposed for the compensation of disturbance to explore optimal control policy. The online scheduling of parameters of MASs is viewed as bounded compensation of dynamics-based protocol, whose stability can be guaranteed by nonfragile control theory. Finally, simulation results are provided to illustrate the effectiveness and superiority of the proposed method.

show abstract

Distributed containment control of multi‐agent systems under asynchronous switching and stochastic disturbances

Cited by 9 publications

References 35 publications

Non-Fragile Disturbance Observer-Based Containment Control of Multi-Agent Systems Over Switching Topologies

Non-Fragile Disturbance Observer-Based Containment Control of Multi-Agent Systems Over Switching Topologies

Consensus of multi-agent systems with randomly occurring nonlinearities via uncertain pinning control under switching topologies *

$H_{\infty}$ Consensus Design and Online Scheduling for Multiagent Systems with Switching Topologies via Deep Reinforcement Learning

Contact Info

Product

Resources

About

Distributed containment control of multi‐agent systems under asynchronous switching and stochastic disturbances

Cited by 9 publications

References 35 publications

Non-Fragile Disturbance Observer-Based Containment Control of Multi-Agent Systems Over Switching Topologies

Non-Fragile Disturbance Observer-Based Containment Control of Multi-Agent Systems Over Switching Topologies

Consensus of multi-agent systems with randomly occurring nonlinearities via uncertain pinning control under switching topologies *

H ∞ Consensus Design and Online Scheduling for Multiagent Systems with Switching Topologies via Deep Reinforcement Learning

Contact Info

Product

Resources

About

$H_{\infty}$ Consensus Design and Online Scheduling for Multiagent Systems with Switching Topologies via Deep Reinforcement Learning