Related papers: Minimal Structural Perturbations for Network Contr…
We consider minimal controllability problems (MCPs) on linear structural descriptor systems. We address two problems of determining the minimum number of input nodes such that a descriptor system is structurally controllable. We show that…
In this paper, we consider the optimal design of networked estimators to minimize the communication/measurement cost under the networked observability constraint. This problem is known as the minimum-cost networked estimation problem, which…
In this paper, we consider composite networks formed from the Kronecker product of smaller networks. We find the observability and controllability properties of the product network from those of its constituent smaller networks. The overall…
Selecting a few available actuators to ensure the controllability of a linear system is a fundamental problem in control theory. Previous works either focus on optimal performance, simplifying the controllability issue, or make the system…
A Network Control System (NCS) consists of control components that interact with the plant over a shared network. The system dynamics of a NCS could be subject to noise arising from randomness in the times at which the data is transmitted…
This paper studies the controllability backbone problem in dynamical networks defined over graphs. The main idea of the controllability backbone is to identify a small subset of edges in a given network such that any subnetwork containing…
Structured pruning is a well-known technique to reduce the storage size and inference cost of neural networks. The usual pruning pipeline consists of ranking the network internal filters and activations with respect to their contributions…
We consider the problem of making a networked system contracting by designing minimal effort local controllers. Our method combines a hierarchical contraction characterization and a matrix-balancing approach to stabilizing a Metzler matrix…
Controllability and observability have long been recognized as fundamental structural properties of dynamical systems, but have recently seen renewed interest in the context of large, complex networks of dynamical systems. A basic problem…
While operating communication networks adaptively may improve utilization and performance, frequent adjustments also introduce an algorithmic challenge: the re-optimization of traffic engineering solutions is time-consuming and may limit…
In this paper, we consider the state controllability of networked systems, where the network topology is directed and weighted and the nodes are higher-dimensional linear time-invariant (LTI) dynamical systems. We investigate how the…
Pinning control on complex dynamical networks has emerged as a very important topic in recent trends of control theory due to the extensive study of collective coupled behaviors and their role in physics, engineering and biology. In…
The way the topological structure transforms from a decoupled to a coupled state in multiplex networks has been extensively studied through both analytical and numerical approaches, often utilizing models of artificial networks. These…
Network reconstruction, i.e., obtaining network structure from data, is a central theme in systems biology, economics and engineering. In some previous work, we introduced dynamical structure functions as a tool for posing and solving the…
In this paper, we study structural controllability of a linear time invariant (LTI) composite system consisting of several subsystems. We assume that the neighbourhood of each subsystem is unconstrained, i.e., any subsystem can interact…
Controlling real-world networked systems, including ecological, biomedical, and engineered networks that exhibit higher-order interactions, remains challenging due to inherent nonlinearities and large system scales. Despite extensive…
In this paper, we investigate optimal control of network-coupled subsystems where the dynamics and the cost couplings depend on an underlying undirected weighted graph. The graph coupling matrix in the dynamics may be the adjacency matrix,…
Humans routinely confront the following key question which could be viewed as a probabilistic variant of the controllability problem: While faced with an uncertain environment governed by causal structures, how should they practice their…
Given a linear system, we consider the problem of finding a small set of variables to affect with an input so that the resulting system is controllable. We show that this problem is NP-hard; indeed, we show that even approximating the…
Increasing the connectivity of a graph is a pivotal challenge in robust network design. The weighted connectivity augmentation problem is a common version of the problem that takes link costs into consideration. The problem is then to find…