The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Coordinated Path-Following in the Presence of Communication Losses and Time Delays
Abstract
This paper addresses the problem of steering a group of vehicles along given spatial paths while holding a desired time-varying geometrical formation pattern. The solution to this problem, henceforth referred to as the coordinated path-following (CPF) problem, unfolds in two basic steps. First, a path-following (PF) control law is designed to drive each vehicle to its assigned path, with a nominal speed profile that may be path dependent. This is done by making each vehicle approach a virtual target that moves along the path according to a conveniently defined dynamic law. In the second step, the speeds of the virtual targets (also called coordination states) are adjusted about their nominal values so as to synchronize their positions and achieve, indirectly, vehicle coordination. In the problem formulation, it is explicitly considered that each vehicle transmits its coordination state to a subset of the other vehicles only, as determined by the communications topology adopted. It is shown that the system that is obtained by putting together the PF and coordination subsystems can be naturally viewed as either the feedback or the cascade connection of the latter two. Using this fact and recent results from nonlinear systems and graph theory, conditions are derived under which the PF and the coordination errors are driven to a neighborhood of zero in the presence of communication losses and time delays. Two different situations are considered. The first captures the case where the communication graph is alternately connected and disconnected (brief connectivity losses). The second reflects an operational scenario where the union of the communication graphs over uniform intervals of time remains connected (uniformly connected in mean). To better root the paper in a nontrivial design example, a CPF algorithm is derived for multiple underactuated autonomous underwater vehicles (AUVs). Simulation results are presented and discussed.
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 and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 2×
“The list of related research topics is vast and includes parallel and distributed computing [7], distributed decision making [60], synchronization in oscillator networks [45], flocking of mobile autonomous agents [5], [18], [28], [53], state agreement and consensus problems [20], [37], [50], [39], [ 43 ], [41], [11],…”
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
Cited by
An Overview of Recent Advances in Coordinated Control of Multiple Autonomous Surface Vehicles
Peng, Z., Wang, J., Wang, D., & Han, Q.-L. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3004343 · Cited by 757
Distributed formation control of nonholonomic mobile robots without global position measurements
Liu, T., & Jiang, Z.-P. (2013) · Automatica · doi:10.1016/j.automatica.2012.11.031 · Cited by 347
Challenges and future trends in marine robotics
Zereik, E., Bibuli, M., Mišković, N., Ridao, P., & Pascoal, A. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.10.002 · Cited by 284
Self-citation
Metadata
- Authors
- Ghabcheloo, R., Aguiar, A. P., Pascoal, A., Silvestre, C., Kaminer, I., & Hespanha, J.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 2009-01
- Volume
- 48
- Issue
- 1
- Pages
- 234-265
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2002027000
- Cited by
- 202
- References
- 3
- FWCI
- 21.34
- 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: Coordinated Path-Following in the Presence of Communication Losses and Time Delays. https://app.cochat.ai/papers/10.1137/060678993
- The paper
- Ghabcheloo, R., Aguiar, A. P., Pascoal, A., Silvestre, C., Kaminer, I., & Hespanha, J. (2009). Coordinated Path-Following in the Presence of Communication Losses and Time Delays. SIAM Journal on Control and Optimization. https://doi.org/10.1137/060678993
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.