Rigorous constraint satisfaction for sampled linear systems
classification
🧮 math.OC
keywords
linearsystemsboundconstraintrigoroussampledsatisfactionaddress
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.