Rigorous constraint satisfaction for sampled linear systems

DOI10.1016/J.EJCON.2016.06.003MaRDI QIDQ328250zbMATH OpenOpenAlexFDO

Authors Moritz Schulze Darup

Publication date 20 October 2016

Published in European Journal of Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.08851

zbMATH Keywords

interval arithmeticmatrix exponentialbranch and bound schemessampled linear systemstate and input constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear systems in control theory (93C05) Sampled-data control/observation systems (93C57)

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.

Recommendations

• Sampling-based approximation of the viability kernel for high-dimensional linear sampled-data systems
• Tightened reachability constraints for the verification of linear hybrid systems
• Sampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems
• Feasibility and constraint analysis of sets of linear matrix inequalities
• scientific article; zbMATH DE number 828039

Cites work

• scientific article; zbMATH DE number 1595639 (Why is no real title available?)
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 3395303 (Why is no real title available?)
• A deterministic algorithm for global optimization
• An algorithm to find maximal state constraint sets for discrete-time linear dynamical systems with bounded controls and states
• Global minimum potential energy conformations of small molecules
• Global one-dimensional optimization using smooth auxiliary functions
• MPC for Sampled-Data Linear Systems: Guaranteeing Constraint Satisfaction in Continuous-Time
• Model Predictive Control of Continuous-Time Nonlinear Systems With Piecewise Constant Control

Cited in

(1)

• Rigorous filtering using linear relaxations

This page was built for publication: Rigorous constraint satisfaction for sampled linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328250)