Loading…
Multiagent Containment Control With Nonconvex States Constraints, Nonuniform Time Delays, and Switching Directed Networks
This brief studies the constrained containment control problem of continuous-time multiagent systems with nonconvex states constraints, nonuniform time delays, and switching directed networks. A distributed containment control algorithm consisting of nonlinear projection, nonlinear constraints, and...
Saved in:
Published in: | IEEE transaction on neural networks and learning systems 2020-11, Vol.31 (11), p.5021-5028 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This brief studies the constrained containment control problem of continuous-time multiagent systems with nonconvex states constraints, nonuniform time delays, and switching directed networks. A distributed containment control algorithm consisting of nonlinear projection, nonlinear constraints, and communication delays is proposed. Based on the model transformation technique, convex analysis method, and the Lyapunov function, we prove that all agents finally converge into the convex hull formed by the given stationary points with arbitrarily bounded communication delays and arbitrarily switching networks as long as each agent jointly has at least one path from the given points to itself. Finally, a numerical example is included to show the effectiveness of theoretical results. |
---|---|
ISSN: | 2162-237X 2162-2388 |
DOI: | 10.1109/TNNLS.2019.2955678 |