Abstract
We study a distributed optimal consensus problem of continuous-time multi-agent systems with a common state set constraint. Each agent is assigned with an individual cost function which is coercive and convex. A distributed control protocol is to be designed to guarantee a consensus, and in the meanwhile reach the minimizer of the aggregate cost functions within the constraint set. Three terms are included in the protocol: local averaging, local projection, and local subgradient with a diminishing but persistent gain. It is shown that the constrained optimal consensus can be achieved under a uniformly jointly connected communication network with bounded time-varying edge weights.
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.
