| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5001751 | European Journal of Control | 2016 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Moritz Schulze Darup,