The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A control Lyapunov function approach to multiagent coordination
Open accessAbstract
In this paper, the multiagent coordination problem is studied. This problem is addressed for a class of robots for which control Lyapunov functions can be found. The main result is a suite of theorems about formation maintenance, task completion time, and formation velocity. It is also shown how to moderate the requirement that, for each individual robot, there exists a control Lyapunov function. An example is provided that illustrates the soundness of the method.
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
Nonlinear and adaptive control design
Krstić, M., Kokotović, P. V., & Kanellakopoulos, I. (1995) · Cited by 10,421
Behavior-based formation control for multirobot teams
Balch, T., & Arkin, R. C. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.736776 · Cited by 3,112
A coordination architecture for spacecraft formation control
Beard, R. W., Lawton, J., & Hadaegh, F. Y. (2001) · IEEE Transactions on Control Systems Technology · doi:10.1109/87.960341 · Cited by 1,112
A decentralized approach to formation maneuvers
Lawton, J. R. T., Beard, R. W., & Young, B. J. (2003) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2003.819598 · Cited by 1,060
(1996) · Communications and Control Engineering · doi:10.1007/978-1-4471-1501-4 · Cited by 1,007
Stabilization with relaxed controls
Artstein, Z. (1983) · Nonlinear Analysis: Theory, Methods & Applications · doi:10.1016/0362-546x(83)90049-4 · Cited by 991
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
Robot control: the task function approach
(1991) · Choice Reviews Online · doi:10.5860/choice.29-2128 · Cited by 445
A decentralized approach to elementary formation manoeuvres
Lawton, A. R., Young, B. J., & Beard, R. W. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2000.846440 · Cited by 114
A control Lyapunov function approach to multi-agent coordination
Ögren, P., Egerstedt, M., & Hu, X. (2002) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/.2001.981040 · Cited by 96
Self-citation
Cited by
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
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
Ogren, P., Fiorelli, E., & Leonard, N. E. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.832203 · Cited by 1,234
Self-citationDistributed Coordination Control of Multiagent Systems While Preserving Connectedness
Ji, M., & Egerstedt, M. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.900638 · Cited by 880
Self-citationStable flocking of mobile agents. I. Fixed topology
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2004) · 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) · doi:10.1109/cdc.2003.1272910 · Cited by 672
Metadata
- Authors
- Ogren, P., Egerstedt, M., & Hu, X.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 2002-10
- Volume
- 18
- Issue
- 5
- Pages
- 847-851
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2166952533
- Cited by
- 387
- References
- 10
- FWCI
- 22.76
- 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.