The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
On the Rendezvous Problem for Multiple Nonholonomic Agents
Open accessAbstract
In this note, a decentralized feedback control strategy that drives a system of multiple nonholonomic unicycles to a rendezvous point in terms of both position and orientation is introduced. The proposed nonholonomic control law is discontinuous and time-invariant and using tools from nonsmooth Lyapunov theory and graph theory the stability of the overall system is examined. Similarly to the linear case, the convergence of the multi-agent system relies on the connectivity of the communication graph that represents the inter-agent communication topology. The control law is first defined in order to guarantee connectivity maintenance for an initially connected communication graph. Moreover, the cases of static and dynamic communication topologies are treated as corollaries of the proposed framework.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
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
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
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
Differential equations with discontinuous right hand sides
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90171-7 · Cited by 4,893
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
A survey of consensus problems in multi-agent coordination
Ren, W., Beard, R. W., & Atkins, E. M. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1470239 · Cited by 1,344
Introduction to dynamic systems: theory, models and applications
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90069-0 · Cited by 1,122
Necessary and sufficient graphical conditions for formation control of unicycles
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841121 · Cited by 1,041
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
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
On Consensus Algorithms for Double-Integrator Dynamics
Ren, W. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.924961 · Cited by 1,413
Robust Finite-Time Consensus Tracking Algorithm for Multirobot Systems
Khoo, S., Xie, L., & Man, Z. (2009) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2009.2014057 · Cited by 835
Distributed robust consensus control in directed networks of agents with time-delay
Lin, P., Jia, Y., & Li, L. (2008) · Systems & Control Letters · doi:10.1016/j.sysconle.2008.01.002 · Cited by 602
Cao, Y., Stuart, D., Ren, W., & Meng, Z. (2011) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2010.2053542 · Cited by 567
Necessary 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
Distributed Adaptive Control of Synchronization in Complex Networks
Yu, W., DeLellis, P., Chen, G., di Bernardo, M., & Kurths, J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2183190 · Cited by 403
Distributed Finite-Time Containment Control for Double-Integrator Multiagent Systems
Wang, X., Li, S., & Shi, P. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2013.2288980 · Cited by 377
Rendezvous of multiple mobile agents with preserved network connectivity
Su, H., Wang, X., & Chen, G. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.03.006 · Cited by 284
Du, H., He, Y., & Cheng, Y. (2014) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2013.2295012 · Cited by 252
Defend the practicality of single-integrator models in multi-robot coordination control
Zhao, S., & Sun, Z. (2017) · 2017 13th IEEE International Conference on Control & Automation (ICCA) · doi:10.1109/icca.2017.8003139 · Cited by 23
Metadata
- Authors
- Dimarogonas, D. V., & Kyriakopoulos, K. J.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2007-05
- Volume
- 52
- Issue
- 5
- Pages
- 916-922
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2150973821
- Cited by
- 491
- References
- 21
- FWCI
- 39.72
- 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.