Library

Rigorous constraint satisfaction for sampled linear systems

We address a specific but recurring problem related to sampled linear systems. In particular, we provide a numerical method for the rigorous verification of constraint satisfaction for linear continuous-time systems between sampling instances. The proposed algorithm combines elements of classical branch and bound schemes from global optimization with a recently published procedure to bound the exponential of interval matrices.

Computer ScienceEngineeringMathematics
Source

Paper

References (17)

01Efficient constraint adaptation for sampled linear systemsM. S. Darup2015 · IEEE Conference on Decision and Control · 6 citations
02On the Exponentiation of Interval MatricesA. Goldsztejn, A. Neumaier2009 · Reliable Computing · 34 citations
03Computing the cube of an interval matrix is NP-HardO. Kosheleva, V. Kreinovich, G. Mayer et al.2005 · ACM Symposium on Applied Computing · 10 citations
04Model predictive control of continuous-time nonlinear systems with piecewise constant controlL. Magni, R. Scattolini2004 · IEEE Transactions on Automatic Control · 132 citations
05Applied Interval Analysis: With Examples in Parameter and State Estimation, Robust Control and RoboticsA. Andrew2002 · 822 citations
06Applied Interval Analysis: With Examples in Parameter and State Estimation, Robust Control and RoboticsL. Jaulin, M. Kieffer, Olivier Didrit et al.2001 · 401 citations
07Controlled safe sets for continuous time linear systemsL. Berardi, E. D. Santis, M. D. Benedetto et al.2001 · European Control Conference · 12 citations
08Global one-dimensional optimization using smooth auxiliary functionsY. Sergeyev1998 · Mathematical programming · 84 citations
09Global minimum potential energy conformations of small moleculesC. Maranas, C. Floudas1994 · Journal of Global Optimization · 177 citations
10A deterministic algorithm for global optimizationL. Breiman, Adele Cutler1993 · Mathematical programming · 147 citations
11Global optimization using interval analysisE. Hansen1992 · The Pure and Applied Mathematics · 1.9k citations
12Convergence of an algorithm to find maximal state constraint sets for discrete-time linear dynamical systems with bounded controls and statesM. Cwikel, P. Gutman1985 · IEEE Conference on Decision and Control · 186 citations

Scroll for more · 5 remaining

Similar papers

A sampling-based approach to scalable constraint satisfaction in linear sampled-data systems---Part I: ComputationShahab Kaynama, J. Gillula, C. Tomlin2014 · arXiv.org · 0 citations In Library
Guaranteed Constraint Satisfaction in Continuous-Time Control ProblemsF. Fontes, L. T. Paiva2019 · IEEE Control Systems Letters · 16 citations In Library
Sampling constraint satisfaction solutions in the local lemma regimeWeiming Feng, Kun He, Yitong Yin2020 · Symposium on the Theory of Computing · 31 citations In Library
Uniform Solution Sampling Using a Constraint Solver As an OracleStefano Ermon, C. Gomes, B. Selman2012 · Conference on Uncertainty in Artificial Intelligence · 69 citations In Library
Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear timeKun He, Chunyang Wang, Yitong Yin2022 · IEEE Annual Symposium on Foundations of Computer Science · 14 citations In Library
Learning Efficient Constraint Graph Sampling for Robotic Sequential ManipulationJoaquim Ortiz-Haro, Valentin N. Hartmann, Ozgur S. Oguz et al.2020 · arXiv (Cornell University) · 13 citations In Library
Learning Efficient Constraint Graph Sampling for Robotic Sequential ManipulationJoaquim Ortiz-Haro, Valentin N. Hartmann, Ozgur S. Oguz et al.2021 In Library
Learning linear dynamical systems under convex constraintsHemant Tyagi, Denis Efimov2023 · arXiv (Cornell University) In Library
A Fast Filtering Algorithm for Continuous Constraint Satisfaction ProblemsV. Ho, K. Robert Lai2019 · Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies · 1 citation In Library
T-SKM-Net: Trainable Neural Network Framework for Linear Constraint Satisfaction via Sampling Kaczmarz-Motzkin MethodHaoyu Zhu, Yao Zhang, Jiashen Ren et al.2026 · Proceedings of the AAAI Conference on Artificial Intelligence In Library
© 2026 NYSGPT2525 LLC