The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Potential Fields for Maintaining Connectivity of Mobile Networks
Abstract
The control of mobile networks of multiple agents raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In this paper, we consider the problem of controlling a network of agents so that the resulting motion always preserves the connectivity property of the network. In particular, the connectivity condition is translated to differentiable constraints on individual agent motion by considering the dynamics of the Laplacian matrix and its spectral properties. Artificial potential fields are then used to drive the agents to configurations away from the undesired space of disconnected networks while avoiding collisions with each other. We conclude by illustrating a class of interesting problems that can be achieved while preserving connectivity constraints.
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
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
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
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
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
Self-citationModeling and control of formations of nonholonomic mobile robots
Desai, J. P., Ostrowski, J. P., & Kumar, V. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976023 · Cited by 1,158
Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
Cortes, J., Martinez, S., & Bullo, F. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.878713 · Cited by 695
Decentralized control of vehicle formations
Lafferriere, G., Williams, A., Caughman, J., & Veerman, J. J. P. (2005) · Systems & Control Letters · doi:10.1016/j.sysconle.2005.02.004 · Cited by 627
On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
Kim, Y., & Mesbahi, M. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.861710 · Cited by 593
Constrained coverage for mobile sensor networks
Poduri, S., & Sukhatme, G. S. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2004.1307146 · Cited by 541
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
Heterophilious Dynamics Enhances Consensus
Motsch, S., & Tadmor, E. (2014) · SIAM Review · doi:10.1137/120901866 · Cited by 482
Decentralized estimation and control of graph connectivity for mobile sensor networks
Yang, P., Freeman, R. A., Gordon, G. J., Lynch, K. M., Srinivasa, S. S., & Sukthankar, R. (2010) · Automatica · doi:10.1016/j.automatica.2009.11.012 · Cited by 430
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
Self-citationDistributed Connectivity Control of Mobile Networks
Zavlanos, M. M., & Pappas, G. J. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006233 · Cited by 343
Self-citationOverview: Collective Control of Multiagent Systems
Knorn, S., Chen, Z., & Middleton, R. H. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2468991 · Cited by 281
Survey on Unmanned Aerial Vehicle Networks: A Cyber Physical System Perspective
Wang, H., Zhao, H., Zhang, J., Ma, D., Li, J., & Wei, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2962207 · Cited by 264
Metadata
- Authors
- Zavlanos, M. M., & Pappas, G. J.
- Venue
- IEEE Transactions on Robotics
- Published
- 2007-08
- Volume
- 23
- Issue
- 4
- Pages
- 812-816
- ISSN
- 1552-3098 (ISSN-L)
- OpenAlex
- W2044437309
- Cited by
- 353
- References
- 17
- FWCI
- 29.19
- Type
- journal article
- 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.