The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Resilient Flocking for Mobile Robot Teams
Abstract
We present a method that enables resilient formation control for mobile robot teams in the presence of noncooperative (defective or malicious) robots. Recent results in network science define graph topological properties that guarantee resilience against faults and attacks on individual nodes in static networks. We build on these results to propose a control policy that allows a team of mobile robots to achieve resilient consensus on the direction of motion. Our strategy relies on dynamic connectivity management that makes use of a metric that characterizes the robustness of the communication network topology. Our method distinguishes itself from prior work in that our connectivity management strategy ensures that the network lies above a critical resilience threshold, guaranteeing that the consensus algorithm always converges to a value within the range of the cooperative agents' initial values. We demonstrate the use of our framework for resilient flocking, and show simulation results with groups of holonomic mobile robots.
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 · cited 1×
“These results critically rely on the assumption that the underlying communication network is either connected throughout time [20], [21], or is jointly connected over infinite sequences of bounded time intervals [1].”
BackgroundCoordination 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
Distributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
Consensus protocols for networks of dynamic agents
Saber, R. O., & Murray, R. M. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1239709 · Cited by 901
Cited by
Signal propagation in complex networks
Ji, P., Ye, J., Mu, Y., Lin, W., Tian, Y., Hens, C., Perc, M., Tang, Y., Sun, J., & Kurths, J. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.03.005 · Cited by 360
Strobel, V., Castelló Ferrer, E., & Dorigo, M. (2020) · Frontiers in Robotics and AI · doi:10.3389/frobt.2020.00054 · Cited by 127
Metadata
- Authors
- Saulnier, K., Saldana, D., Prorok, A., Pappas, G. J., & Kumar, V.
- Venue
- IEEE Robotics and Automation Letters
- Published
- 2017-04
- Volume
- 2
- Issue
- 2
- Pages
- 1039-1046
- ISSN
- 2377-3766 (ISSN-L)
- 2377-3774
- OpenAlex
- W2572839999
- Cited by
- 199
- References
- 4
- FWCI
- 11.74
- 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: Resilient Flocking for Mobile Robot Teams. https://app.cochat.ai/papers/10.1109/lra.2017.2655142
- The paper
- Saulnier, K., Saldana, D., Prorok, A., Pappas, G. J., & Kumar, V. (2017). Resilient Flocking for Mobile Robot Teams. IEEE Robotics and Automation Letters. https://doi.org/10.1109/lra.2017.2655142
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.