Rigorous constraint satisfaction for sampled linear systems
Optimization and Control
2016-03-30 v1
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.
Cite
@article{arxiv.1603.08851,
title = {Rigorous constraint satisfaction for sampled linear systems},
author = {Moritz Schulze Darup},
journal= {arXiv preprint arXiv:1603.08851},
year = {2016}
}