The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Sampled-data discrete-time coordination algorithms for double-integrator dynamics under dynamic directed interaction
Abstract
In this article, we study two sampled-data-based discrete-time coordination algorithms for multi-vehicle systems with double-integrator dynamics under dynamic directed interaction. For both algorithms, we derive sufficient conditions on the interaction graph, the damping gain and the sampling period to guarantee coordination by using the property of infinity products of stochastic matrices. When the conditions on the damping gain and the sampling period are satisfied, the first algorithm guarantees coordination on positions with a zero final velocity if the interaction graph has a directed spanning tree jointly while the second algorithm guarantees coordination on positions with a constant final velocity if the interaction graph has a directed spanning tree at each time interval. Simulation results are presented to show the effectiveness of the theoretical results.
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×
“Consensus algorithms were primarily studied for systems with single-integrator dynamics (see, e.g. Jadbabaie, Lin, and Morse 2003; Lin, Broucke, and Francis 2004; Olfati-Saber and Murray 2004; Moreau 2005; Ren and Beard 2005; Cao, Morse, and Anderson 2008).”
MethodConsensus 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 1×
“…Karatas, and Bullo 2004), flocking (Olfati-Saber 2006; Tanner, Jadbabaie, and Pappas 2007), distributed estimation (Yang, Freeman, and Lynch 2008), and consensus (Olfati-Saber, Fax, and Murray 2007; Ren, Beard, and Atkins 2007), has received significant attention in the control community.”
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 asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
On the spectra of nonsymmetric Laplacian matrices
Agaev, R., & Chebotarev, P. (2005) · Linear Algebra and its Applications · doi:10.1016/j.laa.2004.09.003 · Cited by 177
Cited by
Wen, G., Duan, Z., Yu, W., & Chen, G. (2013) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.2779 · Cited by 334
Sampled-Data Based Consensus of Continuous-Time Multi-Agent Systems With Time-Varying Topology
Gao, Y., & Wang, L. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2112472 · Cited by 288
Overview: Collective Control of Multiagent Systems
Knorn, S., Chen, Z., & Middleton, R. H. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2468991 · Cited by 281
Wen, G., Hu, G., Yu, W., Cao, J., & Chen, G. (2013) · Systems & Control Letters · doi:10.1016/j.sysconle.2013.09.009 · Cited by 280
Metadata
- Authors
- Cao, Y., & Ren, W.
- Venue
- International Journal of Control
- Publisher
- Informa UK Limited
- Published
- 2009-11-04
- Volume
- 83
- Issue
- 3
- Pages
- 506-515
- ISSN
- 0020-7179 (ISSN-L)
- 1366-5820
- OpenAlex
- W2119828030
- Cited by
- 159
- References
- 5
- FWCI
- 12.20
- 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: Sampled-data discrete-time coordination algorithms for double-integrator dynamics under dynamic directed interaction. https://app.cochat.ai/papers/10.1080/00207170903214338
- The paper
- Cao, Y., & Ren, W. (2010). Sampled-data discrete-time coordination algorithms for double-integrator dynamics under dynamic directed interaction. International Journal of Control. https://doi.org/10.1080/00207170903214338
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.