Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systems

DOI10.1080/00207179.2010.543703zbMath1222.93027arXiv1302.5990OpenAlexW1966165240MaRDI QIDQ3015126

Shahab Kaynama, Meeko M. K. Oishi

Publication date: 8 July 2011

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.5990

zbMATH Keywords

projectiontransformationreachability analysisstructure decomposition

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Attainable sets, reachability (93B03)

Related Items (3)

A novel unified framework for solving reachability and invariance problems ⋮ Reachability of weakly nonlinear systems using Carleman linearization ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)

Uses Software

• MPT

Cites Work

• Unnamed Item
• Controllers for reachability specifications for hybrid systems
• Overapproximating reachable sets by Hamilton-Jacobi projections
• Comparing Forward and Backward Reachability as Tools for Safety Analysis
• Optimal approximation of high-order systems subject to polynomial inputs
• A Schur method for balanced-truncation model reduction
• On Reachability Under Uncertainty
• A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
• Ellipsoidal Techniques for Reachability Analysis of Discrete-Time Linear Systems
• Approximation Metrics for Discrete and Continuous Systems

This page was built for publication: Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systems