Abstract
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 language | English |
---|---|
Title of host publication | 2018 European Control Conference, ECC 2018 |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 1851-1856 |
Number of pages | 6 |
ISBN (Electronic) | 978-3-9524-2698-2 |
ISBN (Print) | 978-1-5386-5303-6 |
DOIs | |
Publication status | Published - 2018 |
Event | 16th European Control Conference, ECC 2018 - Limassol, Cyprus Duration: 12 Jun 2018 → 15 Jun 2018 http://www.ecc18.eu/ |
Conference
Conference | 16th European Control Conference, ECC 2018 |
---|---|
Abbreviated title | ECC 2018 |
Country/Territory | Cyprus |
City | Limassol |
Period | 12/06/18 → 15/06/18 |
Internet address |
Keywords
- Network analysis and control
- Control over networks
- Linear systems