Block recursive parallelotopic bounding in set membership identification
For the linear regression model \[ y(t)=\phi ^{'}(t)\theta ^{*} + e(t), \quad t=1,2, \dots \;, \] with the unknown-but-bounded noise \(e(t)\) (\( | e(t)| \leq \epsilon \), \(\forall t\)) the problem of estimation of the parameter vector \(\theta ^{*} \in R^n\) is considered. The techniques of parallelotopical approximation of polytopes are used to solve this set membership identification problem. The emphasis is laid on block processing with \(q > 1\) measurements (instead of one measurement) at each step of the recursive procedure and one obtains the optimal bounding parallelotope algorithm OBPq. Examples which illustrate the advantages of the OBPq method are provided.
- Block recursive parallelotopic bounding in set membership identification
- Block-Sequential Algorithms for Set-Theoretic Estimation
- Identification and application of bounded-parameter models
- On the value of information in system identification-bounded noise case
- Optimal estimation theory for dynamic systems with set membership uncertainty: An overview
- Sequential approximation of feasible parameter sets for identification with set membership uncertainty
- Block recursive parallelotopic bounding in set membership identification
- Asymptotic properties of set membership identification algorithms
- Comparing different approaches to model error modeling in robust identification
- Set-membership errors-in-variables identification of MIMO linear systems
- Robust MPC with recursive model update
- An interval-valued recursive estimation framework for linearly parameterized systems
- One-shot set-membership identification of generalized Hammerstein-Wiener systems
- Finding recurrent sets with backward analysis and trace partitioning
- A set-membership state estimation algorithm based on DC programming
- Interval estimation methods of fault estimation for discrete-time switched systems
- Set membership localization and mapping for autonomous navigation
- A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding
- Computing Blocker Sets for the Regular Post Embedding Problem
- Robust fault detection using zonotope-based set-membership consistency test
- scientific article; zbMATH DE number 522879 (Why is no real title available?)
- Sequential approximation of feasible parameter sets for identification with set membership uncertainty
- A linear programming approach to online set membership parameter estimation for linear regression models
- Robust adaptive model predictive control: Performance and parameter estimation
- A robust adaptive model predictive control framework for nonlinear uncertain systems
- Robust adaptive model predictive control with persistent excitation conditions
- Robust adaptive tube tracking model predictive control for piece‐wise constant reference signals
- Set membership state estimation for discrete-time linear systems with binary sensor measurements
- Guaranteed state estimation by zonotopes
- State estimation in the presence of bounded disturbances
This page was built for publication: Block recursive parallelotopic bounding in set membership identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129648)
