Key-nodes selection problem for minimum cost control of directed networks

The key-nodes selection problem is to determine key nodes from all those connected to external control sources so that the minimum cost is achieved when they are used to control a directed network. Clearly, it is an important issue in both theory and application. But its solution still remains open...

Full description

Saved in:
Bibliographic Details
Main Authors: Li, Guoqi, Tang, Pei, Wen, Changyun, Huang, Jiangshuai, Ma, Cheng
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2020
Subjects:
Online Access:https://hdl.handle.net/10356/141698
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-141698
record_format dspace
spelling sg-ntu-dr.10356-1416982020-06-10T03:27:50Z Key-nodes selection problem for minimum cost control of directed networks Li, Guoqi Tang, Pei Wen, Changyun Huang, Jiangshuai Ma, Cheng School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Key‐nodes Selection Directed Networks The key-nodes selection problem is to determine key nodes from all those connected to external control sources so that the minimum cost is achieved when they are used to control a directed network. Clearly, it is an important issue in both theory and application. But its solution still remains open because of the difficulty in analyzing the graphical properties of key nodes. We present a method, called normalized projected gradient method (NPGM), to address this critical issue. An index notation arrangement-based chain rule is proposed to obtain the gradient of a defined cost function where matrix-by-matrix derivatives are involved. In addition, projection and normalization operators are used to establish the convergence property of NPGM. Simulation results also demonstrate its satisfactory performance. We believe that the presented results of NPGM not only provide a technical breakthrough, but also our discussions on them reveal certain important physical insights regarding key nodes selection in controlling complex directed networks. 2020-06-10T03:27:50Z 2020-06-10T03:27:50Z 2018 Journal Article Li, G., Tang, P., Wen, C., Huang, J., & Ma, C. (2018). Key-nodes selection problem for minimum cost control of directed networks. Optimal Control Applications and Methods, 39(1), 95-113. doi:10.1002/oca.2337 0143-2087 https://hdl.handle.net/10356/141698 10.1002/oca.2337 2-s2.0-85023647750 1 39 95 113 en Optimal Control Applications and Methods © 2017 John Wiley & Sons, Ltd. All rights reserved.
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Key‐nodes Selection
Directed Networks
spellingShingle Engineering::Electrical and electronic engineering
Key‐nodes Selection
Directed Networks
Li, Guoqi
Tang, Pei
Wen, Changyun
Huang, Jiangshuai
Ma, Cheng
Key-nodes selection problem for minimum cost control of directed networks
description The key-nodes selection problem is to determine key nodes from all those connected to external control sources so that the minimum cost is achieved when they are used to control a directed network. Clearly, it is an important issue in both theory and application. But its solution still remains open because of the difficulty in analyzing the graphical properties of key nodes. We present a method, called normalized projected gradient method (NPGM), to address this critical issue. An index notation arrangement-based chain rule is proposed to obtain the gradient of a defined cost function where matrix-by-matrix derivatives are involved. In addition, projection and normalization operators are used to establish the convergence property of NPGM. Simulation results also demonstrate its satisfactory performance. We believe that the presented results of NPGM not only provide a technical breakthrough, but also our discussions on them reveal certain important physical insights regarding key nodes selection in controlling complex directed networks.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Li, Guoqi
Tang, Pei
Wen, Changyun
Huang, Jiangshuai
Ma, Cheng
format Article
author Li, Guoqi
Tang, Pei
Wen, Changyun
Huang, Jiangshuai
Ma, Cheng
author_sort Li, Guoqi
title Key-nodes selection problem for minimum cost control of directed networks
title_short Key-nodes selection problem for minimum cost control of directed networks
title_full Key-nodes selection problem for minimum cost control of directed networks
title_fullStr Key-nodes selection problem for minimum cost control of directed networks
title_full_unstemmed Key-nodes selection problem for minimum cost control of directed networks
title_sort key-nodes selection problem for minimum cost control of directed networks
publishDate 2020
url https://hdl.handle.net/10356/141698
_version_ 1681059367839858688