Preserving Strong Connectivity in Directed Proximity Graphs
From MaRDI portal
Publication:4566777
DOI10.1109/TAC.2017.2671352zbMath1390.05116MaRDI QIDQ4566777
Hasan A. Poonawala, Mark W. Spong
Publication date: 27 June 2018
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Communication networks in operations research (90B18) Connectivity (05C40)
Related Items (7)
Nonlinear integral coupling for synchronization in networks of nonlinear systems ⋮ Cooperative visibility maintenance in SE(3) for multi-robot-networks with limited field-of-view sensors ⋮ Edge-based strict Lyapunov functions for consensus with connectivity preservation over directed graphs ⋮ An internal‐model‐based event‐triggered strategy for rendezvous with connectivity preservation problem of multi‐agent systems ⋮ Rendezvous with connectivity preservation of mobile agents subject to uniform time-delays ⋮ Rendezvous problem of multiple linear uncertain systems under state-dependent dynamic networks ⋮ Stability and robustness of edge-agreement-based consensus protocols for undirected proximity graphs
This page was built for publication: Preserving Strong Connectivity in Directed Proximity Graphs
