Details

Autor(en) / Beteiligte

• Terasaki, Shun
• Sato, Kazuhiro

Titel

Minimal Controllability Problems on Linear Structural Descriptor Systems

Ist Teil von

• IEEE transactions on automatic control, 2022-05, Vol.67 (5), p.2522-2528

Ort / Verlag

New York: IEEE

Erscheinungsjahr

2022

Quelle

IEEE Xplore

Beschreibungen/Notizen

• We consider minimal controllability problems (MCPs) on linear structural descriptor systems. We address two problems of determining the minimum number of input nodes such that a descriptor system is structurally controllable. We show that MCP0 for structural descriptor systems can be solved in polynomial time. This is the same as the existing results on typical structural linear time-invariant (LTI) systems. However, the derivation of the result is considerably different because the derivation technique of the existing result cannot be used for descriptor systems. Instead, we use the Dulmage-Mendelsohn decomposition. Moreover, we prove that the results for MCP1 are different from those for usual LTI systems. In fact, MCP1 for descriptor systems is an NP-hard problem, while MCP1 for LTI systems can be solved in polynomial time.