liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Minimum energy control for complex networks
Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.ORCID-id: 0000-0002-4049-6018
Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.ORCID-id: 0000-0003-4142-6502
2018 (Engelska)Ingår i: Scientific Reports, ISSN 2045-2322, E-ISSN 2045-2322, Vol. 8, artikel-id 3188Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

The aim of this paper is to shed light on the problem of controlling a complex network with minimal control energy. We show first that the control energy depends on the time constant of the modes of the network, and that the closer the eigenvalues are to the imaginary axis of the complex plane, the less energy is required for complete controllability. In the limit case of networks having all purely imaginary eigenvalues (e.g. networks of coupled harmonic oscillators), several constructive algorithms for minimum control energy driver node selection are developed. A general heuristic principle valid for any directed network is also proposed: the overall cost of controlling a network is reduced when the controls are concentrated on the nodes with highest ratio of weighted outdegree vs indegree.

Ort, förlag, år, upplaga, sidor
NATURE PUBLISHING GROUP , 2018. Vol. 8, artikel-id 3188
Nationell ämneskategori
Annan elektroteknik och elektronik
Identifikatorer
URN: urn:nbn:se:liu:diva-145766DOI: 10.1038/s41598-018-21398-7ISI: 000425285200018PubMedID: 29453421OAI: oai:DiVA.org:liu-145766DiVA, id: diva2:1192481
Anmärkning

Funding Agencies|Swedish Research Council [2015-04390]

Tillgänglig från: 2018-03-22 Skapad: 2018-03-22 Senast uppdaterad: 2019-07-05
Ingår i avhandling
1. Methods and algorithms for control input placement in complex networks
Öppna denna publikation i ny flik eller fönster >>Methods and algorithms for control input placement in complex networks
2018 (Engelska)Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

The control-theoretic notion of controllability captures the ability to guide a systems behavior toward a desired state with a suitable choice of inputs. Controllability of complex networks such as traffic networks, gene regulatory networks, power grids etc. brings many opportunities. It could for instance enable improved efficiency in the functioning of a network or lead to that entirely new applicative possibilities emerge. However, when control theory is applied to complex networks like these, several challenges arise. This thesis consider some of these challenges, in particular we investigate how control inputs should be placed in order to render a given network controllable at a minimum cost, taking as cost function either the number of control inputs or the energy that they must exert. We assume that each control input targets only one node (called a driver node) and is either unconstrained or unilateral.

A unilateral control input is one that can assume either positive or negative values but not both. Motivated by the many applications where unilateral controls are common, we reformulate classical controllability results for this particular case into a more computationally-efficient form that enables a large scale analysis. We show that the unilateral controllability problem is to a high degree structural and derive theoretical lower bounds on the minimal number of unilateral control inputs from topological properties of the network, similar to the bounds that exists for the minimal number of unconstrained control inputs. Moreover, an algorithm is developed that constructs a near minimal number of control inputs for a given network. When evaluated on various categories of random networks as well as a number of real-world networks, the algorithm often achieves the theoretical lower bounds.

A network can be controllable in theory but not in practice when completely unreasonable amounts of control energy are required to steer it in some direction. For unconstrained control inputs we show that the control energy depends on the time constants of the modes of the network, and that the closer the eigenvalues are to the imaginary axis of the complex plane, the less energy is required for control. We also investigate the problem of placing driver nodes such that the control energy requirements are minimized (assuming that theoretical controllability is not an issue). For the special case with networks having all purely imaginary eigenvalues, several constructive algorithms for driver node placement are developed. In order to understand what determines the control energy in the general case with arbitrary eigenvalues, we define two centrality measures for the nodes based on energy flow considerations: the first centrality reflects the network impact of a node and the second the ability to control it indirectly. It turns out that whether a node is suitable as driver node or not largely depends on these two qualities. By combining the centralities into node rankings we obtain driver node placements that significantly reduce the control energy requirements and thereby improve the “practical degree of controllability”.

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University Electronic Press, 2018. s. 36
Serie
Linköping Studies in Science and Technology. Licentiate Thesis, ISSN 0280-7971 ; 1814
Nationell ämneskategori
Reglerteknik
Identifikatorer
urn:nbn:se:liu:diva-150886 (URN)10.3384/lic.diva-150886 (DOI)9789176852439 (ISBN)
Presentation
2018-08-30, 00:00 (Engelska)
Opponent
Handledare
Anmärkning

Minor corrections are made in the electronic version of the thesis (Abstract). / Mindre korreigeringar är gjorda i den elektroniska versionen av avhandlingen (i Abstract).

Tillgänglig från: 2018-09-03 Skapad: 2018-09-03 Senast uppdaterad: 2019-10-12Bibliografiskt granskad

Open Access i DiVA

fulltext(5229 kB)86 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 5229 kBChecksumma SHA-512
defe93588f4b2a2c22fda889142e7a829566f92060456212e7ea31a676dffd47f7684f73b91b771347f1918e622206669c5d85518a8d64bc621e9c50559c7c87
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltextPubMed

Sök vidare i DiVA

Av författaren/redaktören
Lindmark, GustavAltafini, Claudio
Av organisationen
ReglerteknikTekniska fakulteten
I samma tidskrift
Scientific Reports
Annan elektroteknik och elektronik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 86 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
pubmed
urn-nbn

Altmetricpoäng

doi
pubmed
urn-nbn
Totalt: 211 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf