The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Flocking with obstacle avoidance: cooperation with limited communication in mobile networks
Abstract
In this paper, we provide a dynamic graph theoretic framework for flocking in presence of multiple obstacles. In particular, we give formal definitions of nets and flocks as spatially induced graphs and define flocking. We introduce the notion of framenets and describe a procedure for automatic construction of an energy function for groups of agents. The task of flocking is achieved via dissipation of this energy according to a protocol that only requires the use of local information. We show that all three rules of Reynolds are hidden in this single protocol. Three types of agents called /spl alpha/, /spl beta/, and /spl gamma/ agents are used to create flocking. Simulation results are provided that demonstrate flocking by 100 dynamic agents.
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
Self-citationCoordination 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
Flocks, herds and schools: A distributed behavioral model
Reynolds, C. W. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37406 · Cited by 7,714
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
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
Diestel, R. (1997) · Cited by 5,082
Simulating dynamical features of escape panic
Helbing, D., Farkas, I., & Vicsek, T. (2000) · Nature · doi:10.1038/35035023 · Cited by 4,916
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Exact robot navigation using artificial potential functions
Rimon, E., & Koditschek, D. E. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.163777 · Cited by 1,835
Cited by
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
Self-citationConsensus 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
Self-citationFlocking 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
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 multi‐vehicle coordinated control via local information exchange
Ren, W., & Atkins, E. (2007) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1147 · Cited by 1,484
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
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
Flocking of Multi-Agents With a Virtual Leader
Su, H., Wang, X., & Lin, Z. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2010897 · Cited by 933
Consensus strategies for cooperative control of vehicle formations
Ren, W. (2007) · IET Control Theory & Applications · doi:10.1049/iet-cta:20050401 · Cited by 931
Distributed 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
You, K., & Xie, L. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2164017 · Cited by 622
High-Order and Model Reference Consensus Algorithms in Cooperative Control of MultiVehicle Systems
Ren, W., Moore, K. L., & Chen, Y. (2007) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.2764508 · Cited by 429
Graph-theoretic connectivity control of mobile robot networks
Zavlanos, M. M., Egerstedt, M. B., & Pappas, G. J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2157884 · Cited by 405
Ultrafast consensus in small-world networks
Olfati-Saber, R. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1470321 · Cited by 384
Differentially private iterative synchronous consensus
Huang, Z., Mitra, S., & Dullerud, G. (2012) · Proceedings of the 2012 ACM workshop on Privacy in the electronic society · doi:10.1145/2381966.2381978 · Cited by 280
Consensus based formation control strategies for multi-vehicle systems
Ren, W. (2006) · 2006 American Control Conference · doi:10.1109/acc.2006.1657384 · Cited by 267
A feedback stabilization and collision avoidance scheme for multiple independent non-point agents
Dimarogonas, D. V., Loizou, S. G., Kyriakopoulos, K. J., & Zavlanos, M. M. (2006) · Automatica · doi:10.1016/j.automatica.2005.09.019 · Cited by 266
Metadata
- Authors
- Saber, R. O., & Murray, R. M.
- Venue
- 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)
- Publisher
- IEEE
- Published
- 2004-07-08
- Volume
- 2
- Pages
- 2022-2028
- OpenAlex
- W2117148399
- Cited by
- 310
- References
- 21
- FWCI
- 16.02
- 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
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.