On Polyhedral Estimates of Reachable Sets of Discrete-Time Systems with Uncertain Matrices and Integral Bounds on Additive Terms
From MaRDI portal
Publication:5122281
DOI10.1007/978-3-030-40616-5_10MaRDI QIDQ5122281
Publication date: 22 September 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_10
discrete-time systems; parallelepipeds; parallelotopes; polyhedral estimates; reachable sets; integral constraints; uncertain matrices
65-XX: Numerical analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial differential equation for evolution of star-shaped reachability domains of differential inclusions
- Dynamics and control of trajectory tubes. Theory and computation
- On the relationship between continuous- and discrete-time control systems
- Method for computing exterior and interior approximations to the reachability sets of bilinear differential systems
- Optimal impulsive control fo compartment models. I: Qualitative aspects
- Ellipsoidal calculus for estimation and control
- Ellipsoidal parameter or state estimation under model uncertainty
- Ellipsoidal bounds on reachable sets of dynamical systems with matrices subjected to uncertain perturbations
- On polyhedral estimates for trajectory tubes of dynamical discrete-time systems with multiplicative uncertainty
- State estimation for linear impulsive differential systems through polyhedral techniques
- Dynamic programming for impulse feedback and fast controls. The linear systems case
- Measure-controlled dynamic systems: polyhedral approximation of their reachable set boundary
- The approximation of reachable sets of control systems with integral constraint on controls
- Reachable Sets of Impulsive Control System with Cone Constraint on the Control and Their Estimates
- Discrete Approximation of Impulsive Differential Inclusions
- State Estimation for Control Systems with a Multiplicative Uncertainty through Polyhedral Techniques
