Abstract
In distributed optimization of multi-agent systems, agents usually cooperate to minimize a global function which is a sum of local objective functions. In this paper, distributed optimization of multi-agent systems is studied in which the global function is in a general form. A communication rule and a distributed algorithm are designed to solve the cooperative optimization problem of multi-agent systems with limited communication which is embodied by an undirected graph. The algorithm is designed according to the proposed communication rule which can share global information indirectly by transmitting information among the agents even though communications among the agents are limited, and is carried out through the true values of agents’ states instead of the estimated ones. A simulation example of distributed optimization of a four-agent system with limited communication is presented to show the effectiveness of the proposed algorithm.
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.
