Strong targeted controllability of dynamical networks

2015 54th IEEE Conference on Decision and Control (CDC) Pub Date : 2015-12-15 DOI:10.1109/CDC.2015.7402965

N. Monshizadeh, Kanat M. Camlibel, H. Trentelman

{"title":"Strong targeted controllability of dynamical networks","authors":"N. Monshizadeh, Kanat M. Camlibel, H. Trentelman","doi":"10.1109/CDC.2015.7402965","DOIUrl":null,"url":null,"abstract":"Network controllability is the ability to control the entire network, meaning that we can drive the network from any initial state to any desired final state in finite time by using appropriate inputs which are applied to a subset of nodes of the network. Despite obvious advantages, network controllability is not always feasible as it may ask for a considerable portion of the nodes to be controlled. Moreover, there are cases where controllability of the entire network is not of interest, but rather we are interested in controllability properties of certain parts of the network. This motivates us to investigate the so-called “targeted controllability” of the network, where controllability is only required for a subset of nodes in the network. Noting that targeted controllability can be treated as an output controllability problem, we investigate the (strong) structural output controllability properties of the network from a topological viewpoint. In addition, we examine the structural properties of the reachable subspace of the network. To this end, we use the notion of zero forcing sets, which has been recently exploited in the context of structural controllability.","PeriodicalId":308101,"journal":{"name":"2015 54th IEEE Conference on Decision and Control (CDC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 54th IEEE Conference on Decision and Control (CDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2015.7402965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 44

Abstract

Network controllability is the ability to control the entire network, meaning that we can drive the network from any initial state to any desired final state in finite time by using appropriate inputs which are applied to a subset of nodes of the network. Despite obvious advantages, network controllability is not always feasible as it may ask for a considerable portion of the nodes to be controlled. Moreover, there are cases where controllability of the entire network is not of interest, but rather we are interested in controllability properties of certain parts of the network. This motivates us to investigate the so-called “targeted controllability” of the network, where controllability is only required for a subset of nodes in the network. Noting that targeted controllability can be treated as an output controllability problem, we investigate the (strong) structural output controllability properties of the network from a topological viewpoint. In addition, we examine the structural properties of the reachable subspace of the network. To this end, we use the notion of zero forcing sets, which has been recently exploited in the context of structural controllability.

查看原文本刊更多论文

动态网络具有很强的目标可控性

网络可控性是控制整个网络的能力，这意味着我们可以通过使用适当的输入来驱动网络在有限的时间内从任何初始状态到任何期望的最终状态，这些输入应用于网络的节点子集。尽管有明显的优势，但网络可控性并不总是可行的，因为它可能要求控制相当一部分节点。此外，在某些情况下，整个网络的可控性不是我们感兴趣的，而是我们对网络某些部分的可控性特性感兴趣。这促使我们研究网络的所谓“目标可控性”，其中可控性仅要求网络中的一部分节点。注意到目标可控性可以视为输出可控性问题，我们从拓扑学的角度研究了网络的(强)结构输出可控性特性。此外，我们还研究了网络的可达子空间的结构性质。为此，我们使用了零强迫集的概念，这是最近在结构可控性的背景下被利用的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2015 54th IEEE Conference on Decision and Control (CDC)

自引率

0.00%

发文量