Related papers: Minimal Driver Nodes for Structural Controllabilit…
We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make…
The minimum-time control problem consists in finding a control policy that will drive a given dynamic system from a given initial state to a given target state (or a set of states) as quickly as possible. This is a well-known challenging…
Network controllability is a powerful tool to study causal relationships in complex systems and identify the driver nodes for steering the network dynamics into desired states. However, due to ill-posed conditions, results become unreliable…
Using a graph-theoretic approach, we derive a new sufficient condition for observability of a Boolean control network (BCN). Based on this condition, we describe two algorithms: the first selects a set of nodes so that observing this set…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…
In this note, we investigate the structural controllability and observability indices of structured systems. We provide counter-examples showing that an existing graph-theoretic characterization for the structural controllability index…
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…
Minimal separators in graphs are an important concept in algorithmic graph theory. In particular, many problems that are NP-hard for general graphs are known to become polynomial-time solvable for classes of graphs with a polynomially…
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…
This paper studies the structural controllability of a class of uncertain switched linear systems, where the parameters of subsystems state matrices are either unknown or zero. The structural controllability is a generalization of the…
We present complexity results regarding a matching-type problem related to structural controllability of dynamical systems modelled on graphs. Controllability of a dynamical system is the ability to choose certain inputs in order to drive…
A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to crossing changes then G is called…
This paper addresses the problem of selecting the minimum number of dedicated sensors to achieve observability in the presence of unknown inputs, namely, the state and input observability, for linear time-invariant systems. We assume that…
In this paper, we study the minimal cost constrained input-output (I/O) and control configuration co-design problem. Given a linear time-invariant plant, where a collection of possible inputs and outputs is known a priori, we aim to…
In this paper, controllability of undirected networked systems with {diffusively coupled subsystems} is considered, where each subsystem is of {identically {\emph{fixed}}} general high-order single-input-multi-output dynamics. The…
Liu et al recently proposed a minimum number of driver nodes needed to obtain full structural controllability over a directed network. Driver nodes are unmatched nodes, from which there are directed paths to all matched nodes. Their most…
Minimal input/output selection is investigated in this paper for each subsystem of a networked system. Some novel sufficient conditions are derived respectively for the controllability and observability of a networked system, as well as…
A faithful description of the state of a complex dynamical network would require, in principle, the measurement of all its $d$ variables, an infeasible task for systems with practical limited access and composed of many nodes with high…
Dynamical systems on hypergraphs can display a rich set of behaviours not observable for systems with pairwise interactions. Given a distributed dynamical system with a putative hypergraph structure, an interesting question is thus how much…
Despite the significant advances in identifying the driver nodes and energy requiring in network control, a framework that incorporates more complicated dynamics remains challenging. Here, we consider the conformity behavior into network…