Relaxation of the greatest common divisor condition for the controllability of bilinear systems

DOI10.1016/J.AUTOMATICA.2023.111048zbMath1528.93020MaRDI QIDQ6110302

Sahand Hadizadeh Kafash, Justin Ruths

Publication date: 5 July 2023

Published in: Automatica (Search for Journal in Brave)

zbMATH Keywords

controllabilitynetworksbilinear systemsstructural properties

Mathematics Subject Classification ID

Controllability (93B05) Nonlinear systems in control theory (93C10) Networked control (93B70)

Cites Work

• Unnamed Item
• On controllability of discrete-time bilinear systems
• Structural control of single-input rank one bilinear systems
• Graphical coprime walk algorithm for structural controllability of discrete-time rank-one bilinear systems
• On the properties of controllability of discrete-time bilinear systems associated with block-triangular and permutation matrices
• On the controllability of a class of discrete bilinear systems
• On controllability of two-dimensional discrete-time bilinear systems
• On controllability of a class of discrete-time homogeneous bilinear systems with solvable controls
• Controllability of a class of discrete time bilinear systems
• Gramian-Based Reachability Metrics for Bilinear Networks
• Structural controllability
• Controllability and near-controllability of a class of discrete-time inhomogeneous bilinear systems
• Structural controllability and structural near-controllability of a class of discrete-time bilinear systems
• Classification of the Structurally Controllable Zero-Patterns for Driftless Bilinear Control Systems
• A controllability counterexample
• On Uncontrollable Discrete-Time Bilinear Systems Which are “Nearly” Controllable
• Analyzing Controllability of Bilinear Systems on Symmetric Groups: Mapping Lie Brackets to Permutations

This page was built for publication: Relaxation of the greatest common divisor condition for the controllability of bilinear systems