In this letter, we introduce and address the problem of structural averaged controllability for linear ensemble systems. We provide examples highlighting differences between others. particular, show that is strictly weaker than single (or ensembles of) establish a set necessary or sufficient conditions sparsity patterns to be structurally controllable.

This article deals with strong structural controllability of linear systems. In contrast to the existing work, structured systems studied in this have a so-called zero/nonzero/arbitrary structure, which means that some entries are equal zero, arbitrary but nonzero, and remaining (zero or nonzero). We formalize terms pattern matrices, whose either fixed arbitrary. establish necessary sufficient ...

The zero forcing number is a graph invariant introduced in order to study the minimum rank of the graph. In the first part of this paper, we first highlight that the computation of the zero forcing number of any directed graph (allowing loops) is NP-hard. Furthermore, we identify a class of directed trees for which the zero forcing number is computable in linear time. The second part of the pap...

The zero forcing number is a graph invariant introduced in order to study the minimum rank of the graph. In the first part of this paper, we first highlight that the computation of the zero forcing number of any directed graph (allowing loops) is NP-hard. Furthermore, we identify a class of directed trees for which the zero forcing number is computable in linear time. The second part of the pap...

This paper deals with strong structural controllability of linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. Instead assuming that nonzero and arbitrary entries can take their values completely independently, this allows equality constraints on these entries, sense a priori restricted to but identical values. To formalize general class ...

The article introduces and solves a structural controllability problem for continuum ensembles of linear time-invariant systems. All the individual systems an ensemble are sparse, governed by same sparsity pattern. Controllability system is, convention, capability using common control input to simultaneously steer every in it. A pattern is structurally controllable if it admits system. main con...

The analysis of control of linear multi-agent systems has recently emerged as an important domain that is receiving a lot of interest from a variety of research communities, and consensus plays a fundamental role in this field of study. We will show how using linear algebra techniques can be analyzed the consensus controllability problem for singular multi-agent systems, in which all agents hav...

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 the system from any given state to any desired state; a graph is said to be structurally controllable if it represents the structure of a controllable system....

The paper presents sufficient conditions for modular (supervisory) control synthesis to equal global control synthesis. In modular control synthesis a supervisory control is synthesized for each module separately and the supervisory control consists of the parallel composition of the modular supervisory controls. The general case of the specification that is indecomposable and not necessarily c...