Abstract
This paper studies the distributed optimization problem for continuous-time multiagent systems with general linear dynamics. The objective is to cooperatively optimize a team performance function formed by a sum of convex local objective functions. Each agent utilizes only local interaction and the gradient of its own local objective function. To achieve the cooperative goal, a couple of fully distributed optimal algorithms are designed. First, an edge-based adaptive algorithm is developed for linear multiagent systems with a class of convex local objective functions. Then, a node-based adaptive algorithm is constructed to solve the distributed optimization problem for a class of agents satisfying the bounded-input bounded-state stable property. Sufficient conditions are given to ensure that all agents reach a consensus while minimizing the team performance function. Finally, numerical examples are provided to illustrate the theoretical results.
| Original language | English |
|---|---|
| Article number | 7857020 |
| Pages (from-to) | 3602-3609 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 62 |
| Issue number | 7 |
| DOIs | |
| State | Published - Jul 2017 |
Keywords
- Adaptive approach
- convex optimization
- distributed optimization
- linear system
- multiagent system
Fingerprint
Dive into the research topics of 'Distributed Optimization for Linear Multiagent Systems: Edge-and Node-Based Adaptive Designs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver