Related papers: Strong Structural Controllability of Signed Networ…
Structural controllability has been proposed as an analytical framework for making predictions regarding the control of complex networks across myriad disciplines in the physical and life sciences (Liu et al., Nature:473(7346):167-173,…
In this paper, we investigate the controllability of a class of formation control systems. Given a directed graph, we assign an agent to each of its vertices and let the edges of the graph describe the information flow in the system. We…
In this paper we investigate a relaxed concept of controllability, known in the literature as herdability, namely the capability of a system to be driven towards the(interior of the) positive orthant. Specifically, we investigate…
Network data has attracted growing interest across scientific domains, prompting the development of various network models. Existing network analysis methods mainly focus on unsigned networks, whereas signed networks, consisting of both…
In this paper, we extend classical results on (i) signature symmetric realizations, and (ii) signature symmetric and passive realizations, to systems which need not be controllable. These results are motivated in part by the existence of…
The notion of strong structural controllability (s-controllability) allows for determining controllability properties of large linear time-invariant systems even when numerical values of the system parameters are not known a priori. The…
This paper addresses the data-driven structured controller design problem for continuous-time linear time-invariant (LTI) systems. We consider three control objectives, including stabilization, $H_2$ performance, and $H_\infty$ performance.…
In this paper some results about the controllability of spectral centrality in a complex network are presented. In particular, the inverse problem of designing an unweigthed graph with a prescribed centrality is considered, by showing that…
We study the strong structural controllability (SSC) of diffusively coupled networks, where the external control inputs are injected to only some nodes, namely the leaders. For such systems, one measure of controllability is the dimension…
Two competing types of interactions often play an important part in shaping system behavior, such as activatory or inhibitory functions in biological systems. Hence, signed networks, where each connection can be either positive or negative,…
Various controllability conditions have been obtained by researchers for heterogeneous networked systems with linear dynamics. However, the literature for nonlinear, heterogeneous networked systems is comparatively less. In this paper we…
Complex networked systems can be modeled as graphs with nodes representing the agents and links describing the dynamic coupling between them. Previous work on network identification has shown that the network structure of linear…
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…
The objective of this paper is to study the controllability of discrete-time linear control systems in solvable Lie groups. In the special case of nilpotent Lie groups, a necessary and sufficient condition for controllability is…
In this paper, classic controllability and structural controllability under two protocols are investigated. For classic controllability, the multiplicity of eigenvalue zero of general Laplacian matrix $L^*$ is shown to be determined by the…
In a signed graph, each link is labeled with either a positive or a negative sign. This is particularly appropriate to model polarized systems. Such a graph can be characterized through the notion of structural balance, which relies on the…
In this paper, several necessary and sufficient graphical conditions are derived for the controllability of multi-agent systems by taking advantage of the proposed concept of controllability destructive nodes. A key step of arriving at this…
This paper introduces a new controllability notion, termed partial strong structural controllability (PSSC), on a structured system whose entries of system matrices are either fixed zero or indeterminate, which naturally extends the…
According to the exact controllability theory, the controllability is investigated analytically for two typical types of self-similar bipartite networks, i.e., the classic deterministic scale-free networks and Cayley trees. Due to their…
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…