| 注册
首页|期刊导航|计算机与数字工程|电力系统最小驱动节点集筛选算法

电力系统最小驱动节点集筛选算法

葛耀东 李琰 宋晴 徐天奇

计算机与数字工程2026,Vol.54Issue(3):617-622,6.
计算机与数字工程2026,Vol.54Issue(3):617-622,6.DOI:10.3969/j.issn.1672-9722.2026.03.006

电力系统最小驱动节点集筛选算法

Minimum Driver Node Sets Selection Algorithm for Power Systems

葛耀东 1李琰 2宋晴 3徐天奇2

作者信息

  • 1. 湖北黄冈应急管理职业技术学院 黄冈 438000
  • 2. 云南民族大学电气信息工程学院 昆明 650500
  • 3. 山东省济宁供电公司 济宁 272113
  • 折叠

摘要

Abstract

In electrical power systems,failure of certain nodes may lead to cascading failures,and a set of nodes needs to be selected for human control in order to reduce losses.Considering the relationship between controllability and topology of the power network,this paper proposes an EC index based on node controllability centrality and electrical betweenness for node selection.Firstly,the minimum number of driving nodes required for the network is determined.Then,effective signal inputs in the network are screened based on the PBH criterion and the theory of precise controllability of the network.Finally,input signals are provided on the optimal set of driving nodes to achieve complete controllability of the network.By using the minimum non-zero eigenvalue of the modified Laplacian matrix as the evaluation index,the proposed method can obtain the optimal set of driving nodes compared with five other screening strategies.

关键词

最小驱动节点集/网络能控性/电气介数/节点控制能力

Key words

minimum driver node set/network controllability/electrical betweenness/node control capability

分类

信息技术与安全科学

引用本文复制引用

葛耀东,李琰,宋晴,徐天奇..电力系统最小驱动节点集筛选算法[J].计算机与数字工程,2026,54(3):617-622,6.

基金项目

国家自然科学基金项目(编号:62062068) (编号:62062068)

云南民族大学2022年硕士研究生科研创新基金项目(编号:2022SKY007) (编号:2022SKY007)

云南省教育厅科学研究基金项目(编号:2023Y0501)资助. (编号:2023Y0501)

计算机与数字工程

1672-9722

访问量0
|
下载量0
段落导航相关论文