Abstract
This paper studies the mean square consentability problem for a network of double-integrator agents with stochastic switching topology. It is proved that in Markov-switching topologies, the network is mean square consentable under linear consensus protocol if and only if the union of graphs in the switching topology set has globally reachable nodes. A necessary and sufficient condition of the mean square consensus is obtained. Finally, an LMI approach to the design of the consensus protocol is presented. Numerical simulations are given to illustrate the results.
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.
