Related papers: Composition Rules for Strong Structural Controllab…
This paper addresses problems on the structural design of control systems taking explicitly into consideration the possible application to large-scale systems. We provide an efficient and unified framework to solve the following major…
The minimum number of inputs needed to control a network is frequently used to quantify its controllability. Control of linear dynamics through a minimum set of inputs, however, often has prohibitively large energy requirements and there is…
In this paper we consider complex dynamical networks modeled by means of state space systems running in discrete time. We assume that the dependency structure of the variables within the (nonlinear) network equations is known and use…
The zero forcing number is a graph invariant introduced to study the minimum rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero forcing number of a simple undirected graph. We complete this NP-hardness result by…
In this paper, given a linear time-invariant strongly connected network, we study the problem of determining the minimum number of state variables that need to be simultaneously actuated and measured to ensure structural controllability and…
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,…
Influence diagram is a graphical representation of belief networks with uncertainty. This article studies the structural properties of a probabilistic model in an influence diagram. In particular, structural controllability theorems and…
This paper proposes a notion termed perturbation-tolerant structural controllability (PTSC) to study the generic property of controllability preservation/resilience of structured linear systems under structured perturbations. A structured…
From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular…
Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee…
Network structure plays a critical role in functionality and performance of network systems. This paper examines structural adaptivity of diffusively coupled, directed multi-agent networks that are subject to diffusion performance. Inspired…
We consider the problem of designing distributed controllers to guarantee dissipativity of a networked system comprised of dynamically coupled subsystems. We require that the control synthesis is carried out locally at the subsystem-level,…
This paper is concerned with the controllability problem of a connected threshold graph following the Laplacian dynamics. An algorithm is proposed to generate a spanning set of orthogonal Laplacian eigenvectors of the graph from a…
This paper presents new graph-theoretic conditions for structural target controllability of directed networks. After reviewing existing conditions and highlighting some gaps in the literature, we introduce a new class of network systems,…
The lack of studying the complex organization of directed network usually limits to the understanding of underlying relationship between network structures and functions. Structural controllability and structural predictability, two…
Predicting how the brain can be driven to specific states by means of internal or external control requires a fundamental understanding of the relationship between neural connectivity and activity. Network control theory is a powerful tool…
Structural controllability challenges arise from imprecise system modeling and system interconnections in large scale systems. In this paper, we study structural control of bilinear systems on the special Euclidean group. We employ graph…
This paper focuses on proposing a general control framework for large-scale Boolean networks (\texttt{BNs}). Only by the network structure, the concept of structural controllability for \texttt{BNs} is formalized. A necessary and sufficient…
In this paper, the strong structural controllability of the network is analyzed. Based on the unified definition of equitable partition for kinds of scene, the upper bound of the strong structural controllable subspace in different…
In this paper, we discuss the controllability of a family of linear time-invariant (LTI) networks defined on a signed graph. In this direction, we introduce the notion of positive and negative signed zero forcing sets for the…