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 条
  • [41] Uniform Strong Connectivity is Not Necessary for Non-Bayesian Social Learning on Time-Varying Directed Graphs
    Parasnis, Rohit
    Franceschetti, Massimo
    Touri, Behrouz
    2020 59TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2020, : 4933 - 4940
  • [42] Sparse Subgraphs for 2-Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Karanasiou, Aikaterini
    Papadopoulos, Charis
    Parotsidis, Nikos
    EXPERIMENTAL ALGORITHMS, SEA 2016, 2016, 9685 : 150 - 166
  • [43] DETERMINING UNI-CONNECTIVITY IN DIRECTED-GRAPHS
    BUCHSBAUM, AL
    CARLISLE, MC
    INFORMATION PROCESSING LETTERS, 1993, 48 (01) : 9 - 12
  • [44] Sparse certificates for 2-connectivity in directed graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Karanasiou, Aikaterini
    Papadopoulos, Charis
    Parotsidis, Nikos
    THEORETICAL COMPUTER SCIENCE, 2017, 698 : 40 - 66
  • [45] CONNECTIVITY OF REGULAR DIRECTED GRAPHS WITH SMALL DIAMETERS.
    Imase, Makoto
    Soneoka, Terunao
    Okada, Keiji
    IEEE Transactions on Computers, 1985, C-34 (03) : 267 - 273
  • [46] CONNECTIVITY OF REGULAR DIRECTED-GRAPHS WITH SMALL DIAMETERS
    IMASE, M
    SONEOKA, T
    OKADA, K
    IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (03) : 267 - 273
  • [47] DAG-width - Connectivity Measure for Directed Graphs
    Obdrzalek, Jan
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 814 - 821
  • [48] Privacy Preserving Strong Simulation Queries on Large Graphs
    Xu, Lyu
    Jiang, Jiaxin
    Choi, Byron
    Xu, Jianliang
    Bhowmick, Sourav S.
    2021 IEEE 37TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2021), 2021, : 1500 - 1511
  • [49] STRONG CONNECTIVITY IN DIRECTIONAL NEAREST-NEIGHBOR GRAPHS
    FLINCHBAUGH, BE
    JONES, LK
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (04): : 461 - 463
  • [50] The strong connectivity of bubble-sort star graphs
    Wang, Shiying
    Wang, Mujiangshan
    COMPUTER JOURNAL, 2019, 62 (05): : 715 - 729