Abstract
This paper studies the distributed convex optimization problem for multi-agent systems over undirected and connected networks. Motivated by practical considerations, we propose a new distributed optimization algorithm with event-triggered communication. The proposed event detection is decentralized, sampled-data and not requires periodic communications among agents to calculate the threshold. Based on Lyapunov approaches, we show that the proposed algorithm is asymptotically converge to the unknown optimizer if the design parameters are chosen properly. We also give an upper bound on the convergence rate. Finally, we illustrate the effectiveness of the proposed algorithm by a numerical simulation.
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 callMore From: International Journal of Control, Automation and Systems
Disclaimer: 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.
