The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Distributed leader–follower flocking control for multi-agent dynamical systems with time-varying velocities
Open accessAbstract
Using tools from algebraic graph theory and nonsmooth analysis in combination with ideas of collective potential functions, velocity consensus and navigation feedback, a distributed leader–follower flocking algorithm for multi-agent dynamical systems with time-varying velocities is developed where each agent is governed by second-order dynamics. The distributed leader–follower algorithm considers the case in which the group has one virtual leader with time-varying velocity. For each agent i, this algorithm consists of four terms: the first term is the self nonlinear dynamics which determines the final time-varying velocity, the second term is determined by the gradient of the collective potential between agent i and all of its neighbors, the third term is the velocity consensus term, and the fourth term is the navigation feedback from the leader. To avoid an impractical assumption that the informed agents sense all the states of the leader, the new designed distributed algorithm is developed by making use of observer-based pinning navigation feedback. In this case, each informed agent only has partial information about the leader, yet the velocity of the whole group can still converge to that of the leader and the centroid of those informed agents, having the leader’s position information, follows the trajectory of the leader asymptotically. Finally, simulation results are presented to demonstrate the validity and effectiveness of the theoretical analysis. Surprisingly, it is found that the local minimum of the potential function may not form a commonly believed α lattice.
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×
“Based on the algebraic graph theory [27,28], it has been shown that network connectivity is the key in reaching consensus [1,2,4,5,7,8].”
BackgroundOptimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Horn, R. A., & Johnson, C. R. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511840371 · Cited by 9,319
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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Novel Type of Phase Transition in a System of Self-Driven Particles
Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., & Shochet, O. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.1226 · Cited by 7,380
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
Flocks, herds and schools: A distributed behavioral model
Reynolds, C. W. (1987) · ACM SIGGRAPH Computer Graphics · doi:10.1145/37402.37406 · Cited by 5,148
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
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
Cited by
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
Self-citationSynchronization via Pinning Control on General Complex Networks
Yu, W., Chen, G., Lü, J., & Kurths, J. (2013) · SIAM Journal on Control and Optimization · doi:10.1137/100781699 · Cited by 384
Self-citationSecond-order consensus for multi-agent systems with switching topology and communication delay
Qin, J., Gao, H., & Zheng, W. X. (2011) · Systems & Control Letters · doi:10.1016/j.sysconle.2011.03.004 · Cited by 339
Consensus of high-order multi-agent systems with large input and communication delays
Zhou, B., & Lin, Z. (2014) · Automatica · doi:10.1016/j.automatica.2013.12.006 · Cited by 309
Metadata
- Authors
- Yu, W., Chen, G., & Cao, M.
- Venue
- Systems & Control Letters
- Publisher
- Elsevier BV
- Published
- 2010-09
- Volume
- 59
- Issue
- 9
- Pages
- 543-552
- ISSN
- 0167-6911 (ISSN-L)
- OpenAlex
- W1998030085
- Cited by
- 284
- References
- 39
- FWCI
- 21.35
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.