The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots
Open accessAbstract
A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned a control law, which is the sum of two elements: a repulsive potential field, which is responsible for the collision avoidance objective, and an attractive potential field, which forces the agents to converge to a configuration where they are close to each other. Furthermore, the attractive potential field forces the agents that are initially located within the sensing radius of an agent to remain within this area for all time. In this way, the connectivity properties of the initially formed communication graph are rendered invariant for the trajectories of the closed-loop system. It is shown that under the proposed control law, agents converge to a configuration where each agent is located at a bounded distance from each of its neighbors. The results are also extended to the case of nonholonomic kinematic unicycle-type agents and to the case of dynamic edge addition. In the latter case, we derive a smaller bound in the swarm size than in the static case.
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
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788
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
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
Cited by
A survey of multi-agent formation control
Oh, K.-K., Park, M.-C., & Ahn, H.-S. (2015) · Automatica · doi:10.1016/j.automatica.2014.10.022 · Cited by 2,457
Hoy, M., Matveev, A. S., & Savkin, A. V. (2015) · Robotica · doi:10.1017/s0263574714000289 · Cited by 469
Graph-theoretic connectivity control of mobile robot networks
Zavlanos, M. M., Egerstedt, M. B., & Pappas, G. J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2157884 · Cited by 405
Survey on Unmanned Aerial Vehicle Networks: A Cyber Physical System Perspective
Wang, H., Zhao, H., Zhang, J., Ma, D., Li, J., & Wei, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2962207 · Cited by 264
Distributed Control of Networked Dynamical Systems: Static Feedback, Integral Action and Consensus
Andreasson, M., Dimarogonas, D. V., Sandberg, H., & Johansson, K. H. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2309281 · Cited by 256
Self-citation
Metadata
- Authors
- Dimarogonas, D. V., & Kyriakopoulos, K. J.
- Venue
- IEEE Transactions on Robotics
- Published
- 2008-10
- Volume
- 24
- Issue
- 5
- Pages
- 1213-1223
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2144354132
- Cited by
- 235
- References
- 3
- FWCI
- 26.89
- Type
- journal article
- Language
- en
- Open access
- green
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: Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots. https://app.cochat.ai/papers/10.1109/tro.2008.2002313
- The paper
- Dimarogonas, D. V., & Kyriakopoulos, K. J. (2008). Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2008.2002313
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.