Further Results on Containment Control for Multi-Agent Systems with Variable Communication Delay

Li, Zhipeng; Li, Tao; Yuan, Ruiting; Fei, Shumin

doi:10.1007/s13369-018-3379-8

Cited by 6 publications

(1 citation statement)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While utilizing PI‐type protocols, stability is an important issue that has to be studied since this protocol increases the type of the open‐loop system and it can influence the stability of the closed‐loop system. In addition, time delay from different sources such as processors, actuators, and sensors can occur and considering time delay from any of these sources, stability assurance would be more significant [19‐24]. Therefore, in this paper, while utilizing the proposed protocol and considering unknown input time delay, asymptotic stability of the multi‐agent system is guaranteed.…”

Section: Introductionmentioning

confidence: 99%

Containment control of high‐order multi‐agent systems with heterogeneous uncertainties, dynamic leaders, and time delay

Parsa

Danesh

2019

Asian Journal of Control

View full text Add to dashboard Cite

This paper deals with containment control of multi‐agent systems where high‐order canonical controllable linear systems with heterogeneous uncertainties are considered as the agents' dynamics. The leaders are dynamic with polynomial‐type trajectories. In this paper, the control protocol is smooth and it is constructed from a flexible combination of local state feedback controller and a PI‐type protocol. Utilizing this protocol, containment without suffering from chattering phenomena and consideration of any bound on the agents' states is achieved. In addition, the flexibility of this protocol helps the designer to reduce or even discard the inter‐agent communication. Recalling the significant effects of time delay on the performance and stability of multi‐agent systems, in this paper input time delay is also considered. Following a Lyapunov‐Krasovskii stability approach, two linear matrix inequalities (LMIs) are derived, and then solving the LMIs' gains of the protocol are attained such that asymptotic stability of the multi‐agent system under switching graph topology is guaranteed. Finally, the feasibility of the LMIs and the validity of the theoretical results are demonstrated through some numerical examples.

show abstract

Section: Introductionmentioning

confidence: 99%