Structural Controllability of Polysystems via Directed Hypergraph Representation
arXiv:2310.09964
Abstract
This document explores structural controllability of polynomial dynamical systems or polysystems. We extend Lin's concept of structural controllability for linear systems, offering hypergraph-theoretic methods to rapidly assess strong controllability. Our main result establishes that a polysytem is structurally controllable when its hypergraph representation contains no hyperedge dilation and no inaccessible vertices. We propose two efficient, scalable algorithms to validate these conditions.
12 pages, 3 algorithms