The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Swarm assignment and trajectory optimization using variable-swarm, distributed auction assignment and sequential convex programming
Abstract
This paper presents a distributed, guidance and control algorithm for reconfiguring swarms composed of hundreds to thousands of agents with limited communication and computation capabilities. This algorithm solves both the optimal assignment and collision-free trajectory generation for robotic swarms, in an integrated manner, when given the desired shape of the swarm (without pre-assigned terminal positions). The optimal assignment problem is solved using a distributed auction assignment that can vary the number of target positions in the assignment, and the collision-free trajectories are generated using sequential convex programming. Finally, model predictive control is used to solve the assignment and trajectory generation in real time using a receding horizon. The model predictive control formulation uses current state measurements to resolve for the optimal assignment and trajectory. The implementation of the distributed auction algorithm and sequential convex programming using model predictive control produces the swarm assignment and trajectory optimization (SATO) algorithm that transfers a swarm of robots or vehicles to a desired shape in a distributed fashion. Once the desired shape is uploaded to the swarm, the algorithm determines where each robot goes and how it should get there in a fuel-efficient, collision-free manner. Results of flight experiments using multiple quadcopters show the effectiveness of the proposed SATO algorithm.
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Constrained model predictive control: Stability and optimality
Mayne, D. Q., Rawlings, J. B., Rao, C. V., & Scokaert, P. O. M. (2000) · Automatica · doi:10.1016/s0005-1098(99)00214-9 · Cited by 8,736
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
A Survey on Aerial Swarm Robotics
Chung, S.-J., Paranjape, A. A., Dames, P., Shen, S., & Kumar, V. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2857475 · Cited by 672
Self-citationNeural-Fly enables rapid learning for agile flight in strong winds
O’Connell, M., Shi, G., Shi, X., Azizzadenesheli, K., Anandkumar, A., Yue, Y., & Chung, S.-J. (2022) · Science Robotics · doi:10.1126/scirobotics.abm6597 · Cited by 288
Self-citationMalyuta, D., Reynolds, T. P., Szmuk, M., Lew, T., Bonalli, R., Pavone, M., & Açıkmeşe, B. (2022) · IEEE Control Systems · doi:10.1109/mcs.2022.3187542 · Cited by 259
McCord, C., Queralta, J. P., Gia, T. N., & Westerlund, T. (2019) · 2019 European Conference on Mobile Robots (ECMR) · doi:10.1109/ecmr.2019.8870934 · Cited by 23
Adajania, V. K., Zhou, S., Singh, A. K., & Schoellig, A. P. (2023) · 2023 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra48891.2023.10161063 · Cited by 23
Metadata
- Authors
- Morgan, D., Subramanian, G. P., Chung, S.-J., & Hadaegh, F. Y.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2016-02-23
- Volume
- 35
- Issue
- 10
- Pages
- 1261-1285
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2282034761
- Cited by
- 189
- References
- 3
- FWCI
- 17.37
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Swarm assignment and trajectory optimization using variable-swarm, distributed auction assignment and sequential convex programming. https://app.cochat.ai/papers/10.1177/0278364916632065
- The paper
- Morgan, D., Subramanian, G. P., Chung, S.-J., & Hadaegh, F. Y. (2016). Swarm assignment and trajectory optimization using variable-swarm, distributed auction assignment and sequential convex programming. The International Journal of Robotics Research. https://doi.org/10.1177/0278364916632065
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.