Abstract
In this paper, a procedure for the recursive approximation of the feasible parameter set of a linear model with a set membership uncertainty description is provided. Approximating regions of parallelotopic shape are considered. The new contribution of this paper consists in devising a general procedure allowing for block processing of q > 1 measurements at each recursion step. Based on this, several approximation strategies for polytopes are presented. Simulation experiments are performed, showing the effectiveness of the algorithm as compared to the original algorithm processing one measurement at each step.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
