The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Containment Control in Mobile Networks
Open accessAbstract
In this paper, the problem of driving a collection of mobile robots to a given target destination is studied. In particular, we are interested in achieving this transfer in an orderly manner so as to ensure that the agents remain in the convex polytope spanned by the leader-agents, while the remaining agents, only employ local interaction rules. To this aim we exploit the theory of partial difference equations and propose hybrid control schemes based on stop-go rules for the leader-agents. Non-Zenoness, liveness and convergence of the resulting system are also analyzed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Mathematical Analysis and Numerical Methods for Science and Technology
(2000) · Springer eBooks · doi:10.1007/978-3-642-58090-1 · Cited by 1,517
Flocking in Fixed and Switching Networks
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895948 · Cited by 1,431
Tanner, H. G., Pappas, G. J., & Kumar, V. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.825275 · Cited by 775
Controlling formations of multiple mobile robots
Desai, J. P., Ostrowski, J., & Kumar, V. (2002) · Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146) · doi:10.1109/robot.1998.680621 · Cited by 686
On the regularization of Zeno hybrid automata
Johansson, K. H., Egerstedt, M., Lygeros, J., & Sastry, S. (1999) · Systems & Control Letters · doi:10.1016/s0167-6911(99)00059-6 · Cited by 548
Self-citationLeader-based multi-agent coordination: controllability and optimal control
Ji, M., Muhammad, A., & Egerstedt, M. (2006) · 2006 American Control Conference · doi:10.1109/acc.2006.1656406 · Cited by 161
Self-citationAnalysis of Coordination in Multi-Agent Systems Through Partial Difference Equations
Giancarlo Ferrari-trecate, A., Buffa, A., & Gati, M. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.876805 · Cited by 143
Self-citationConnectivity graphs as models of local interactions
Muhammad, A., & Egerstedt, M. (2004) · Applied Mathematics and Computation · doi:10.1016/j.amc.2004.08.039 · Cited by 42
Self-citationA Unified Analytical Look at Reynolds Flocking Rules
Saber, R. O. (2003) · doi:10.21236/ada462292 · Cited by 16
Hierarchical Containment Control in Heterogeneous Mobile Networks
Ji, M., Egerstedt, M., Ferrari‐Trecate, G., et al. (2006) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 14
Self-citation
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
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
Recent Advances in Consensus of Multi-Agent Systems: A Brief Survey
Qin, J., Ma, Q., Shi, Y., & Wang, L. (2017) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2016.2636810 · Cited by 863
A Survey on Aerial Swarm Robotics
Chung, S.-J., Paranjape, A. A., Dames, P., Shen, S., & Kumar, V. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2857475 · Cited by 672
Cao, Y., Ren, W., & Egerstedt, M. (2012) · Automatica · doi:10.1016/j.automatica.2012.05.071 · Cited by 606
Self-citation
Metadata
- Authors
- Ji, M., Ferrari-Trecate, G., Egerstedt, M., & Buffa, A.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2008-09
- Volume
- 53
- Issue
- 8
- Pages
- 1972-1975
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2123876595
- Cited by
- 810
- References
- 14
- FWCI
- 21.40
- 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
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.