State estimation for dynamic systems via parallelotopes optimization and parallel computations
From MaRDI portal
Publication:4235449
This paper investigates approximation of tubes of trajectories for linear continuous and discrete dynamical systems. The author develops a theory of approximation schemes by families of parallelotopes. A study of suitable families of parallelotopes is given in view of approximating tubes. Estimations of attainability sets are given (even with state constraints). An application to external and internal approximation of tubes is discussed.
Recommendations
- scientific article; zbMATH DE number 3869188
- scientific article; zbMATH DE number 4127130
- Fast state estimation scheme for multidimensional dynamic systems
- scientific article; zbMATH DE number 19453
- Full parallel decomposition of computational algorithm with discrete state estimator
- Optimization of the algorithms of guaranteed state estimation of dynamic systems
- scientific article; zbMATH DE number 4158527
- scientific article; zbMATH DE number 5287631
- Optimization approach to guaranteed state estimation of dynamic systems
Cites work
Cited in
(20)- External polyhedral estimates of reachable sets of discrete-time systems with integral bounds on additive terms
- Description of the attainable sets of one-dimensional differential inclusions
- Multicriteria optimization of convex dynamical systems
- Comparison of guaranteed state estimators for linear time-invariant systems
- Control synthesis via parallelotopes: optimzation and parallel compuations
- On the boundedness of outer polyhedral estimates for reachable sets of linear systems
- Fast state estimation scheme for multidimensional dynamic systems
- scientific article; zbMATH DE number 519883 (Why is no real title available?)
- scientific article; zbMATH DE number 2061444 (Why is no real title available?)
- scientific article; zbMATH DE number 750761 (Why is no real title available?)
- scientific article; zbMATH DE number 1882420 (Why is no real title available?)
- On Ellipsoidal Techniques for Reachability Analysis. Part II: Internal Approximations Box-valued Constraints
- ON SOLVING AN ENHANCED EVASION PROBLEM FOR LINEAR DISCRETE–TIME SYSTEMS
- Reachability computation for polynomial dynamical systems
- A linear programming approach to online set membership parameter estimation for linear regression models
- Iterative algorithms for multiscale state estimation. II: Numerical investigations
- On the boundedness and unboundedness of external polyhedral estimates for reachable sets of linear differential systems
- On solving terminal approach and evasion problems for linear discrete-time systems under state constraints
- A grid-based algorithm for constructing reachable sets in the presence of phase constraints
- An efficient algorithm for state estimation problems with coupling inequality constraints
This page was built for publication: State estimation for dynamic systems via parallelotopes optimization and parallel computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4235449)