Abstract
This paper considers event-triggered strategies for the well-known multi-agent average consensus problem. While many results on this topic either require global knowledge of the network topology or cannot guarantee a positive minimum inter-event time, more recent works have been able to establish a positive minimum inter-event time using a fully distributed dynamic triggering mechanism. However, these results only apply to undirected communication networks and are tied to specific Lyapunov functions. This paper presents two different novel distributed dynamic event-triggered algorithms with designable positive minimum inter-event times for directed communication networks. We show that both algorithms have the same asymptotic convergence properties and compare their transient properties through simulations.
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.
