Preserving Strong Connectivity in Directed Proximity Graphs

被引:29
|
作者
Poonawala, Hasan A. [1 ]
Spong, Mark W. [2 ]
机构
[1] Univ Texas Austin, Inst Computat Engn & Sci, Austin, TX 78012 USA
[2] Univ Texas Dallas, Erik Jonsson Sch Engn & Comp Sci, Richardson, TX 75080 USA
关键词
Multi-robot systems; Decentralized control; Communication networks; Graph theory; ALGEBRAIC CONNECTIVITY; MOBILE;
D O I
10.1109/TAC.2017.2671352
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes a method to maintain the strong connectivity property of a mobile robot ad hoc network in the presence of disturbances or additional control goals. Each robot has a communication range modeled by an n-dimensional sphere centered at the robot. The spheres for different robots may have different radii, resulting in a directed communication network. This paper is based on two concepts. The first is the structure of the Perron vector for reducible stochastic matrices. The second is the design of nonlinear controllers that ensure that two robots remain within a certain distance of each other despite disturbances. The results are supported by analysis and simulations.
引用
收藏
页码:4392 / 4404
页数:13
相关论文
共 50 条
  • [31] A Connectivity Preserving Framework for Distributed Motion Coordination in Proximity Networks
    Jaleel, Hassan
    Abbas, Waseem
    2018 ANNUAL AMERICAN CONTROL CONFERENCE (ACC), 2018, : 6640 - 6645
  • [32] A Heuristic Strong Connectivity Algorithm for Large Graphs
    Cosgaya-Lozano, Adan
    Zeh, Norbert
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2009, 5526 : 113 - 124
  • [33] On restricted edge connectivity of strong product graphs
    Ou, Jianping
    Zhao, Weisheng
    ARS COMBINATORIA, 2015, 123 : 55 - 64
  • [34] On strong Menger-connectivity of star graphs
    Oh, E
    Chen, FE
    DISCRETE APPLIED MATHEMATICS, 2003, 129 (2-3) : 499 - 511
  • [35] ON THE STRONG ARNOL'D HYPOTHESIS AND THE CONNECTIVITY OF GRAPHS
    Van der Holst, Hein
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2010, 20 : 574 - 585
  • [36] Detachment of vertices of graphs preserving edge-connectivity
    Fleiner, B
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (03) : 581 - 591
  • [37] Detachments preserving local edge-connectivity of graphs
    Jordán, T
    Szigeti, Z
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 17 (01) : 72 - 87
  • [38] The strong game colouring number of directed graphs
    Chan, Wai Hong
    Shiu, Wai Chee
    Sun, Pak Kiu
    Zhu, Xuding
    DISCRETE MATHEMATICS, 2013, 313 (10) : 1070 - 1077
  • [39] COVERS AND STRONG COVERS IN DIRECTED BIPARTITE GRAPHS
    VIDYASANKAR, K
    JOURNAL OF GRAPH THEORY, 1980, 4 (03) : 279 - 286
  • [40] BaW 1.0-A Problem Specific SAT Solver for Effective Strong Connectivity Testing in Sparse Directed Graphs
    Biro, Csaba
    Kusper, Gabor
    2018 18TH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND INFORMATICS (CINTI), 2018, : 137 - 142