The DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
Graph-theoretic connectivity control of mobile robot networks
Abstract
We provide a theoretical framework for controlling graph connectivity in mobile robot networks. We discuss proximity-based communication models composed of disk-based or uniformly-fading-signal-strength communication links. A graph-theoretic definition of connectivity is provided, as well as an equivalent definition based on algebraic graph theory, which employs the adjacency and Laplacian matrices of the graph and their spectral properties. Based on these results, we discuss centralized and distributed algorithms to maintain, increase, and control connectivity in mobile robot networks. The various approaches discussed in this paper range from convex optimization and subgradient-descent algorithms, for the maximization of the algebraic connectivity of the network, to potential fields and hybrid systems that maintain communication links or control the network topology in a least restrictive manner. Common to these approaches is the use of mobility to control the topology of the underlying communication network. We discuss applications of connectivity control to multirobot rendezvous, flocking and formation control, where so far, network connectivity has been considered an assumption.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
Consensus 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 · cited 2×
“In fact, recent work on distributed consensus and state agreement has strongly depended on multihop communication for convergence and performance guarantees [1]–[ 14 ].”
BackgroundCoordination 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
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
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
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897
Self-citationStability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
Flocks, herds, and schools: A quantitative theory of flocking
Toner, J., & Tu, Y. (1998) · Physical Review E · doi:10.1103/physreve.58.4828 · Cited by 1,626
Laplacian matrices of graphs: a survey
Merris, R. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90486-3 · Cited by 1,520
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
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-citationVirtual leaders, artificial potentials and coordinated control of groups
Leonard, N. E., & Fiorelli, E. (2003) · Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228) · doi:10.1109/cdc.2001.980728 · Cited by 1,262
The Mobile Radio Propagation Channel
Parsons, J. D. (2001) · Wiley eBooks · doi:10.1002/0470841524 · Cited by 1,180
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
Chen, B., Jamieson, K., Balakrishnan, H., & Morris, R. (2002) · Wireless Networks · doi:10.1023/a:1016542229220 · Cited by 1,071
Design challenges for energy-constrained ad hoc wireless networks
Goldsmith, A. J., & Wicker, S. B. (2002) · IEEE Wireless Communications · doi:10.1109/mwc.2002.1028874 · Cited by 952
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
Self-citationConvergence in Multiagent Coordination, Consensus, and Flocking
Blondel, V. D., Hendrickx, J. M., Olshevsky, A., & Tsitsiklis, J. N. (2006) · Proceedings of the 44th IEEE Conference on Decision and Control · doi:10.1109/cdc.2005.1582620 · Cited by 859
Local Control Strategies for Groups of Mobile Autonomous Agents
Lin, Z., Broucke, M., & Francis, B. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.825639 · Cited by 850
The Number of Neighbors Needed for Connectivity of Wireless Networks
Xue, F., & Kumar, P. R. (2004) · Wireless Networks · doi:10.1023/b:wine.0000013081.09837.c0 · Cited by 821
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
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
Distributed Control of Robotic Networks
Bullo, F. (2009) · Cited by 588
Distributed memoryless point convergence algorithm for mobile robots with limited visibility
Ando, H., Oasa, Y., Suzuki, I., & Yamashita, M. (1999) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.795787 · Cited by 564
Graph theory, combinatorics, and applications
Alavi, Y., Chartrand, G., & Oellermann, O. R. (2017) · Cited by 520
Distributed algorithms for reaching consensus on general functions
Cortés, J. (2008) · Automatica · doi:10.1016/j.automatica.2007.07.022 · Cited by 469
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
Average consensus problems in networks of agents with delayed communications
Bliman, P.-A., & Ferrari-Trecate, G. (2008) · Automatica · doi:10.1016/j.automatica.2007.12.010 · Cited by 429
Gathering of asynchronous robots with limited visibility
Flocchini, P., Prencipe, G., Santoro, N., & Widmayer, P. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.01.001 · Cited by 399
Potential Fields for Maintaining Connectivity of Mobile Networks
Zavlanos, M. M., & Pappas, G. J. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.900642 · Cited by 353
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-citationGhosh, A., & Boyd, S. (2006) · Proceedings of the 45th IEEE Conference on Decision and Control · doi:10.1109/cdc.2006.377282 · Cited by 341
Decentralized Control of Connectivity for Multi-Agent Systems
De Gennaro, M. C., & Jadbabaie, A. (2006) · Proceedings of the 45th IEEE Conference on Decision and Control · doi:10.1109/cdc.2006.377041 · Cited by 322
Critical power for asymptotic connectivity
Gupta, P., & Kumar, P. R. (1998) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1998.760846 · Cited by 321
Flocking with obstacle avoidance: cooperation with limited communication in mobile networks
Saber, R. O., & Murray, R. M. (2004) · 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) · doi:10.1109/cdc.2003.1272912 · Cited by 310
A cone-based distributed topology-control algorithm for wireless multi-hop networks
Li, L., Halpern, J. Y., Bahl, P., Wang, Y., & Wattenhofer, R. P. (2005) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.842229 · Cited by 308
Non-linear protocols for optimal distributed consensus in networks of dynamic agents
Bauso, D., Giarré, L., & Pesenti, R. (2006) · Systems & Control Letters · doi:10.1016/j.sysconle.2006.06.005 · Cited by 251
Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots
Dimarogonas, D. V., & Kyriakopoulos, K. J. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2002313 · Cited by 235
Hybrid Control for Connectivity Preserving Flocking
Zavlanos, M. M., Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2033750 · Cited by 225
Self-citationFlocking while preserving network connectivity
Zavlanos, M. M., Jadbabaie, A., & Pappas, G. J. (2007) · 2007 46th IEEE Conference on Decision and Control · doi:10.1109/cdc.2007.4434530 · Cited by 210
Self-citationAjorlou, A., Momeni, A., & Aghdam, A. G. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2072570 · Cited by 204
A decentralized algorithm for spectral analysis
Kempe, D., & McSherry, F. (2008) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.04.014 · Cited by 180
Connectivity management in mobile robot teams
Stump, E., Jadbabaie, A., & Kumar, V. (2008) · 2008 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2008.4543418 · Cited by 167
On State-dependent dynamic graphs and their controllability properties
Mesbahi, M. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.843858 · Cited by 161
Controlling Connectivity of Dynamic Graphs
Zavlanos, M. M., & Pappas, G. J. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2005.1583186 · Cited by 148
Self-citationMaintaining limited-range connectivity among second-order agents
Notarstefano, G., Savla, K., Bullo, F., & Jadbabaie, A. (2006) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2006.1656533 · Cited by 126
Experimental Testbed for Large Multirobot Teams
Michael, N., Fink, J., & Kumar, V. (2008) · IEEE Robotics & Automation Magazine · doi:10.1109/m-ra.2007.914924 · Cited by 121
Maintaining Connectivity in Mobile Robot Networks
Michael, N., Zavlanos, M. M., Kumar, V., et al. (2009) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-00196-3_14 · Cited by 101
Self-citationEnforcing Network Connectivity in Robot Team Missions
Tardioli, D., Mosteo, A. R., Riazuelo, L., Villarroel, J. L., & Montano, L. (2010) · The International Journal of Robotics Research · doi:10.1177/0278364909358274 · Cited by 98
Sufficient conditions for connectivity maintenance and rendezvous in leader–follower networks
Gustavi, T., Dimarogonas, D. V., Egerstedt, M., & Xiaoming Hu, A. (2009) · Automatica · doi:10.1016/j.automatica.2009.10.014 · Cited by 96
Self-citationDecentralized estimation and control of graph connectivity in mobile sensor networks
Yang, P., Freeman, R. A., Gordon, G. J., Lynch, K., Srinivasa, S. S., & Sukthankar, R. (2008) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2008.4586897 · Cited by 91
Distributed Motion Constraints for Algebraic Connectivity of Robotic Networks
Schuresko, M., & Cortés, J. (2009) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-009-9328-8 · Cited by 72
Average consensus problems in networks of agents with delayed communications
Bliman, P., & Giancarlo Ferrari-trecate, A. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2005.1583300 · Cited by 65
Distributed Averaging on Asynchronous Communication Networks
Mehyar, M., Spanos, D. P., Pongsajapan, J., et al. (2006) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2005.1583363 · Cited by 49
A framework for decentralised feedback connectivity control with application to sensor networks
Knorn, F., Stanojević, R., Corless, M., et al. (2009) · International Journal of Control · doi:10.1080/00207170902912056 · Cited by 33
Achieving coordination tasks in finite time via nonsmooth gradient flows
Cortés, J. (2006) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2005.1583184 · Cited by 27
The effects of predation risk on scanning and flocking behavior in dunlin
Barbosa, A. (1997) · Digital Commons - University of South Florida (University of South Florida) · Cited by 23
Distributed topology control of dynamic networks
Zavlanos, M. M., Tahbaz-Salehi, A., Jadbabaie, A., et al. (2008) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2008.4586894 · Cited by 16
Self-citationA class of bounded distributed controllers for connectivity preservation of unicycles
Ajorlou, A., & Aghdam, A. G. (2010) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2010.5717486 · Cited by 11
Cited by
Heterophilious Dynamics Enhances Consensus
Motsch, S., & Tadmor, E. (2014) · SIAM Review · doi:10.1137/120901866 · Cited by 482
Self-Triggered Consensus for Multi-Agent Systems With Zeno-Free Triggers
Fan, Y., Liu, L., Feng, G., & Wang, Y. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2405294 · Cited by 357
Metadata
- Authors
- Zavlanos, M. M., Egerstedt, M. B., & Pappas, G. J.
- Venue
- Proceedings of the IEEE
- Published
- 2011-09
- Volume
- 99
- Issue
- 9
- Pages
- 1525-1540
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2063801303
- Cited by
- 405
- References
- 64
- FWCI
- 41.76
- 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.