Abstract
This study investigates the issue of mean square consensus for multiple agents connected by a directed network. The graph of the network is supposed to have a spanning tree and each agent is taken as a Markovian jumping system. By utilising the event-triggered strategy, some sufficient conditions for consensus are presented whether the transition rates for the Markov chain being completely known or not. Furthermore, the event-triggered function designed in this study is dependent on the stochastic sampled-data from neighbouring agents. Theoretical results are provided according to the graph theory, Lyapunov functional and linear matrix inequality approach. Finally, a numerical example is given to demonstrate the effectiveness of the theoretical analysis.
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.
