The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Containment control with multiple stationary or dynamic leaders under a directed interaction graph
Abstract
In this paper, we study the problem of distributed containment control of a group of mobile autonomous agents with multiple stationary or dynamic leaders under fixed and switching directed network topologies. In the case of stationary leaders, we show necessary and sufficient conditions on the network topology such that all followers will ultimately converge to the stationary convex hull formed by the stationary leaders for arbitrary initial states in both continuous-time and discrete-time settings. In particular, when the network topology is fixed, the final states of the followers are constant. When the network topology is switching, the final states of the followers might be changing depending on the switching graphs. In the case of dynamic leaders, we propose a distributed tracking control algorithm without velocity measurements and derive conditions on the network topology and the control gain to guarantee that all followers will ultimately converge to the dynamic convex hull formed by the dynamic leaders for arbitrary initial states.
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 2×
“A common consensus algorithm for (1) was studied in [5], [12], [13], [14], [15] as”
BackgroundMethodConsensus 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×
“Detailed information about the recent study of consensus algorithms in cooperative control can be found in [3], [4].”
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
Cited by
Distributed finite-time attitude containment control for multiple rigid bodies
Meng, Z., Ren, W., & You, Z. (2010) · Automatica · doi:10.1016/j.automatica.2010.09.005 · Cited by 978
Self-citationCao, Y., Ren, W., & Egerstedt, M. (2012) · Automatica · doi:10.1016/j.automatica.2012.05.071 · Cited by 606
Self-citationCao, Y., Stuart, D., Ren, W., & Meng, Z. (2011) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2010.2053542 · Cited by 567
Self-citationLi, Z., Ren, W., Liu, X., & Fu, M. (2013) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1847 · Cited by 517
Self-citationNecessary and sufficient conditions for containment control of networked multi-agent systems
Liu, H., Xie, G., & Wang, L. (2012) · Automatica · doi:10.1016/j.automatica.2012.05.010 · Cited by 436
Metadata
- Authors
- Cao, Y., & Ren, W.
- Venue
- Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
- Publisher
- IEEE
- Published
- 2009-12
- Pages
- 3014-3019
- OpenAlex
- W2164818660
- Cited by
- 193
- References
- 3
- FWCI
- 10.26
- Type
- conference paper
- 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: Containment control with multiple stationary or dynamic leaders under a directed interaction graph. https://app.cochat.ai/papers/10.1109/cdc.2009.5399946
- The paper
- Cao, Y., & Ren, W. (2009). Containment control with multiple stationary or dynamic leaders under a directed interaction graph. Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference. https://doi.org/10.1109/cdc.2009.5399946
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.
