Admissible Set for Linear Systems under Linear State Constraints
Abstract
This paper presents a method for computing inner polytopic approximations of admissible sets for continuous-time linear control systems subject to affine state constraints. Building upon barrier theory and the explicit solution of linear systems, a structured sampling procedure is developed to generate boundary samples of the admissible set directly, thereby avoiding the discretization of large regions of the state space required by many viability and reachability methods. The proposed framewo...
Description / Details
This paper presents a method for computing inner polytopic approximations of admissible sets for continuous-time linear control systems subject to affine state constraints. Building upon barrier theory and the explicit solution of linear systems, a structured sampling procedure is developed to generate boundary samples of the admissible set directly, thereby avoiding the discretization of large regions of the state space required by many viability and reachability methods. The proposed framework computes admissible sets for the individual state constraints separately and combines the resulting inner approximations by intersection, avoiding the explicit treatment of simultaneous active constraints. The boundary samples are converted into a half-space representation, and runtime complexity analyses are derived for both the sampling and polytope reconstruction algorithms. An extension of the framework to Hammerstein systems is also presented. The proposed approach is demonstrated on a triple integrator and a higher-dimensional mass-spring-damper chain, illustrating the geometric construction of the admissible set approximation and demonstrating scalability to higher-dimensional systems.
Source: arXiv:2607.29664v1 - http://arxiv.org/abs/2607.29664v1 PDF: https://arxiv.org/pdf/2607.29664v1 Original Link: http://arxiv.org/abs/2607.29664v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Aug 3, 2026
Mathematics
Mathematics
0