Abstract

In this paper, a time-varying distributed convex optimization problem is studied for a multi-agent system with double-integrator dynamics over a fixed directed network. The objective is to minimize a team cost function formed by the sum of local time-varying cost functions, each of which is known to only an individual agent, through local interaction. Here the optimal point is time-varying and creates an optimal trajectory. Sufficient conditions are derived to guarantee that all agents reach a consensus in a finite time while minimizing the team cost function.

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 call

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.