The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Distributed optimization for cooperative agents: application to formation flight
Abstract
We present a simple decentralized algorithm to solve optimization problems involving cooperative agents. Cooperative agents share a common objective and simultaneously pursue private goals. Furthermore, agents are constrained by limited communication capabilities. The algorithm is based on dual decomposition techniques and appears to be very intuitive. It solves the dual problem of an artificially decomposed version of the primal problem, replacing one large computationally intractable problem with many smaller tractable problems. It returns a feasible solution to the primal problem as well as an upper bound on the distance between this solution and the global optimum. Both convex and nonconvex examples are presented, the complexity of the convex case is analyzed, and the savings in complexity are demonstrated for both examples. Finally, by showing that there is no duality gap in these examples, optimality is certified.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Cited by
NEXT: In-Network Nonconvex Optimization
Lorenzo, P. D., & Scutari, G. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2524588 · Cited by 473
Robust distributed model predictive control
Richards, A., & How, J. P. (2007) · International Journal of Control · doi:10.1080/00207170701491070 · Cited by 344
Xu, J., Zhu, S., Soh, Y. C., & Xie, L. (2015) · 2015 54th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402509 · Cited by 332
Cooperative Control Design for Time-Varying Formations of Multi-Agent Systems
Brinon-Arranz, L., Seuret, A., & Canudas-de-Wit, C. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2303213 · Cited by 262
Augmented distributed optimization for networked systems
Xu, J. (2019) · doi:10.32657/10356/68805 · Cited by 5
Metadata
- Authors
- Raffard, R. L., Tomlin, C. J., & Boyd, S. P.
- Venue
- 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)
- Publisher
- IEEE
- Published
- 2004
- Pages
- 2453-2459 Vol.3
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2099901267
- Cited by
- 245
- References
- 1
- FWCI
- 4.44
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.