Chai, Wei and Sun, Xianfang ![]() |
Abstract
An improved set membership identification algorithm by zonotopes is proposed for time-varying parameterized discretetime systems. The system noises are assumed to be unknown but bounded (UBB). The improved algorithm based on a tighter description of the intersection of a zonotope and a strip can give a smaller zonotope containing the parameters consistent with measured outputs and the given bounds of the noises. Simulation experiments are conducted showing the performance of the improved algorithm as compared to the original algorithm and the recursive optimal bounding parallelotope (ROBP) algorithm. Two types of parameter variation, uniformly distributed and uniformly heavy tailed parameter variations, are considered. The results show that the improved algorithm is the best in terms of the guaranteed bounds of the parameters.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Computer Science & Informatics |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Language other than English: | Chinese |
Publisher: | International Society for Optical Engineering |
ISSN: | 0277786X |
Related URLs: | |
Last Modified: | 19 Oct 2022 09:58 |
URI: | https://orca.cardiff.ac.uk/id/eprint/22787 |
Citation Data
Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |