Abstract
This paper investigates the distributed continuous-time optimization problem, which consists of a group of agents with variant local cost functions. An adaptive consensus-based algorithm with event triggering communications is introduced, which can drive the participating agents to minimize the global cost function and exclude the Zeno behavior. Compared to the existing results, the proposed event-based algorithm is independent of the parameters of the cost functions, using only the relative information of neighboring agents, and hence is fully distributed. Furthermore, the constraints of the convexity of the cost functions are relaxed.
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: IEEE Transactions on Systems, Man, and Cybernetics: 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.
