Abstract
The paper investigates containment control for multi-agent systems under Markov switching topologies. By using graph theory and the tools of stochastic analysis, sufficient conditions of mean square containment control problems are derived for the second-order multi-agent systems. Then the obtained results are further extended to high-order multi-agent systems.
Highlights
Cooperative control for multi-agent systems has attracted increasing attention, due to its many applications in different fields
Consensus is the basic problem of cooperative control for multi-agent systems, which means that every agent tends to the same value in a team
Containment control for multi-agent systems means that all followers are driven into the convex hull generated by the leaders
Summary
Cooperative control for multi-agent systems has attracted increasing attention, due to its many applications in different fields. In [ ], dynamic containment algorithms based on observers for the high-order continuous-time multi-agent systems were proposed under the fixed topology. By using the graph theory and knowledge of stochastic analysis, mean square consensus of the discrete-time multi-agent systems was discussed under Markov switching topologies in [ ]. The authors in [ ] extended the results in [ ] to leader-following consensus of discrete-time multi-agent systems under Markov switching topologies. Consensus conditions of continuous-time and discrete-time high-order multi-agent systems were given, respectively, where the random link failures between agents were discussed in [ ]. Mean square containment control problems of the first-order and second-order multi-agent systems with communication noises was investigated in [ ]. Inspired by the results in [ – ], this paper further investigates the containment control for multi-agent systems under Markov switching topologies. We extend the results of the second-order multi-agent systems to high-order multi-agent systems
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: 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.
