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 条
  • [1] Decentralized Estimation and Control for Preserving the Strong Connectivity of Directed Graphs
    Sabattini, Lorenzo
    Secchi, Cristian
    Chopra, Nikhil
    IEEE TRANSACTIONS ON CYBERNETICS, 2015, 45 (10) : 2273 - 2286
  • [2] Incremental Strong Connectivity and 2-Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Parotsidis, Nikos
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 529 - 543
  • [3] STRONG CONNECTIVITY IN DIRECTED GRAPHS UNDER FAILURES, WITH APPLICATIONS
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Parotsidis, Nikos
    SIAM JOURNAL ON COMPUTING, 2020, 49 (05) : 865 - 926
  • [4] Strong Connectivity in Directed Graphs under Failures, with Applications
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Parotsidis, Nikos
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1880 - 1899
  • [5] Decentralized Control for Maintenance of Strong Connectivity for Directed Graphs
    Sabattini, Lorenzo
    Secchi, Cristian
    Chopra, Nikhil
    2013 21ST MEDITERRANEAN CONFERENCE ON CONTROL AND AUTOMATION (MED), 2013, : 978 - 986
  • [6] Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness
    Hellweg, Frank
    Sohler, Christian
    ALGORITHMS - ESA 2012, 2012, 7501 : 599 - 610
  • [7] Algebraic connectivity of directed graphs
    Wu, CW
    LINEAR & MULTILINEAR ALGEBRA, 2005, 53 (03): : 203 - 223
  • [8] Extended Connectivity in Directed Graphs
    Zupan, Jure
    ACTA CHIMICA SLOVENICA, 2010, 57 (03) : 604 - 608
  • [9] Proximity and remoteness in directed and undirected graphs
    Ai, Jiangdong
    Gerke, Stefanie
    Gutin, Gregory
    Mafunda, Sonwabile
    DISCRETE MATHEMATICS, 2021, 344 (03)
  • [10] Connectivity of Strong Products of Graphs
    Spacapan, Simon
    GRAPHS AND COMBINATORICS, 2010, 26 (03) : 457 - 467