Zero controllability in discrete-time structured systems

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

3 Citations (Scopus)


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 directed graphs to represent this structure. The dependency structure also appears in the equations of a linearization of the network. In order for such a linearization to be a good approximation of the original network, its state should stay as close as possible to the point of linearization. In this paper, we investigate how the latter can be achieved by an appropriate selection of states as driver nodes, so that through these driver nodes the whole state of the network can be steered to the point of linearization. We present conditions in graph terms for this to be possible and deriver an algorithm for the associate driver node selection. By means of a simple reasoning, we show that finding such a selection of smallest size comes down to solving a minimal cover problem, which is known to be an NP-hard problem.
Original languageEnglish
Title of host publication2018 European Control Conference, ECC 2018
Place of PublicationPiscataway, NJ
Number of pages6
ISBN (Electronic)978-3-9524-2698-2
ISBN (Print)978-1-5386-5303-6
Publication statusPublished - 2018
Event16th European Control Conference, ECC 2018 - Limassol, Cyprus
Duration: 12 Jun 201815 Jun 2018


Conference16th European Control Conference, ECC 2018
Abbreviated titleECC 2018
Internet address


  • Network analysis and control
  • Control over networks
  • Linear systems


Dive into the research topics of 'Zero controllability in discrete-time structured systems'. Together they form a unique fingerprint.

Cite this