The computability of LQR and LQG control

DOI10.1145/3447928.3456634OpenAlexW3158587643MaRDI QIDQ6201582

Rupak Majumdar, Sadegh Soudjani

Publication date: 21 February 2024

Published in: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3447928.3456634

zbMATH Keywords

decidabilityLQRLQGtranscendental numbers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The continuous Skolem-Pisot problem
• A new polynomial-time algorithm for linear programming
• An effective version of the Lindemann-Weierstrass theorem for interpolation determinants
• Turing meets Schanuel
• Quadratic programming is in NP
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• Fast Multiple-Precision Evaluation of Elementary Functions
• On the decidability of reachability in linear time-invariant systems
• Transcendental Numbers
• Model-checking continuous-time Markov chains
• Open problems in mathematical systems and control theory
• Algorithms in real algebraic geometry
• A survey of computational complexity results in systems and control
• Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach

This page was built for publication: The computability of LQR and LQG control