Distributed Design of Controllable and Robust Networks using Zero Forcing and Graph Grammars
This paper studies the problem of designing networks that are strong structurally controllable, and robust simultaneously. For given network specifications, including the number of nodes $N$, the number of leaders $N_L$, and diameter $D$, where $2 \le D \le N/N_L$, we propose graph constructions generating strong structurally controllable networks. We also compute the number of edges in graphs, which are maximal for improved robustness measured by the algebraic connectivity and Kirchhoff index. For the controllability analysis, we utilize the notion of zero forcing sets in graphs. Additionally, we present graph grammars, which are sets of rules that agents apply in a distributed manner to construct the graphs mentioned above. We also numerically evaluate our methods. This work exploits the trade-off between network controllability and robustness and generates networks satisfying multiple design criteria.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Resilient Strong Structural Controllability in Networks using Leaky Forcing in Graphs
This paper studies the problem of selecting input nodes (leaders) to make networks strong structurally controllable despite misbehaving nodes and edges. We utilize a graph-based characterization of network strong structu…
Deep Reinforcement Learning for Minimum Zero-Forcing Sets
This paper explores the problem of finding the minimum zero-forcing set on undirected graphs and proposes an adapted machine-learning framework to solve the problem. The minimum zero-forcing set problem is a graph colori…
Reinforcement LearningLow-Complexity Distributed XL-MIMO for Multiuser Detection
In this paper, the zero-forcing and regularized zero-forcing schemes operating in crowded extra-large MIMO (XL-MIMO) scenarios with a fixed number of subarrays have been emulated using the randomized Kaczmarz algorithm (…
Computation of the Distance-based Bound on Strong Structural Controllability in Networks
In this paper, we study the problem of computing a tight lower bound on the dimension of the strong structurally controllable subspace (SSCS) in networks with Laplacian dynamics. The bound is based on a sequence of vecto…
Deep Equivariant Multi-Agent Control Barrier Functions
With multi-agent systems increasingly deployed autonomously at scale in complex environments, ensuring safety of the data-driven policies is critical. Control Barrier Functions have emerged as an effective tool for enfor…
Robot NavigationZero-shot Generalization