Abstract
Abstract In this paper, a distributed event-triggered algorithm was proposed to solve a convex quadratic optimization problem of multi-agent systems under undirected and connected topologies. The event-triggered condition of each agent just requires its own state value and the state values of its neighbors at the triggering time, and hence the continuous communication and calculation are not required. Moreover, the minimum event-triggered interval is bounded by the sampling time and the Zeno behavior is therefore naturally avoided. The result is also extended to the networks with undirected and switching topologies. Numerical simulations show the effectiveness of the proposed approach.
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.
