Strong Structural Controllability of Directed Graphs via Zero Forcing Sets

被引：2

作者：

Park, Nam-Jin ^{[1
]}

Kim, Yeong-Ung ^{[1
]}

Ahn, Hyo-Sung ^{[1
]}

机构：

[1] Gwangju Inst Sci & Technol, Sch Mech Engn, Gwangju, South Korea

来源：

IFAC PAPERSONLINE | 2023年 / 56卷 / 02期

关键词：

Structured networks; strong structural controllability; zero forcing sets; graph decomposition; merging rule; SYSTEMS; ROBUSTNESS; NETWORKS;

D O I：

10.1016/j.ifacol.2023.10.1495

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents several conditions for strong structural controllability of a directed structured network, which is determined by the non-zero/zero patterns of the weights of directed edges. First, we introduce the existing notion of zero forcing sets with the necessary and sufficient condition for strong structural controllability. Based on the zero forcing sets, we introduce the necessary condition that a strongly structurally controllable graph with the minimum number of m-inputs can be decomposed into m-disjoint controllable paths and bridge edges between them. With a disjoint controllable path as a basic graph, we explore the properties of a strongly structurally controllable graph. Then, we present several merging rules that can maintain the strong structural controllability based on the notion of zero forcing sets.

引用

页码：3441 / 3446

页数：6