2 research outputs found
Structural Controllability of Undirected Diffusive Networks with Vector-Weighted Edges
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 underlying graph of the network topology is
{\emph{vector-weighted}}, rather than scalar-weighted. The aim is to find
conditions under which the networked system is structurally controllable, i.e.,
for almost all vector values for interaction links of the network topology, the
corresponding system is controllable. It is proven that, the networked system
is structurally controllable, if and only if each subsystem is controllable and
observable, and the network topology is globally input-reachable. These
conditions are further extended to the cases {with multi-input-multi-output
subsystems and matrix-weighted edges,} or where both directed and undirected
interaction links exist.Comment: Fix some typos. The full version of an accepted version of IEEE
Control Systems Letters 10.1109/LCSYS.2020.298625
Generic Detectability and Isolability of Topology Failures in Networked Linear Systems
This paper studies the possibility of detecting and isolating topology
failures (including link failures and node failures) of a networked system from
subsystem measurements, in which subsystems are of fixed high-order linear
dynamics, and the exact interaction weights among them are unknown. We prove
that in such class of networked systems with the same network topologies, the
detectability and isolability of a given topology failure (set) are generic
properties, indicating that it is the network topology that dominates the
property of being detectable or isolable for a failure (set). We first give
algebraic conditions for detectability and isolability of arbitrary parameter
perturbations for a lumped plant, and then derive graph-theoretical necessary
and sufficient conditions for generic detectability and isolability of topology
failures for the networked systems. On the basis of these results, we consider
the problems of deploying the smallest set of sensors for generic detectability
and isolability. We reduce the associated sensor placement problems to the
hitting set problems, which can be effectively solved by greedy algorithms with
guaranteed approximation performances.Comment: 12 pages, 8 figures, to appear in IEEE Transactions on Control of
Network System