Abstract
This paper discusses a convex optimisation problem with a common set of constraints in the framework of multi-agent systems. Each agent only exchanges information with its neighbours and collaboratively searches for the optimal solution of the global function. To this addressed problem, a distributed multi-step subgradient projection algorithm is developed, where an adaptive event-triggering protocol is designed to govern the information exchange. It is disclosed that the state of each agent representing the estimate of the optimal solution asymptotically converges to one of the optimal solutions under suitably chosen stepsizes and momentum parameters. Simulation results verify that the proposed algorithm has better convergence performance than the standard event-triggered subgradient projection algorithm. In addition, the communication frequency between agents can be effectively reduced to save communication resource consumption.
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.
