Abstract

In this paper, we consider the containment consensus control problem for multi-agent systems with measurement noises and time-varying communication delays under directed networks. By using stochastic analysis tools and algebraic graph theory, we prove that the followers can converge to the convex hull spanned by the leaders in the sense of mean square if the allowed upper bound of the time-varying delays satisfies a certain sufficient condition. Moreover, the time-varying delays are asymmetric for each follower agent, and the time-delay-dependent consensus condition is derived. Finally, numerical simulations are provided to illustrate the effectiveness of the obtained theoretical results.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.