Recursive triangulation description of the feasible parameter set for bounded-noise models

He, L. and Sun, Xianfang ORCID: https://orcid.org/0000-0002-6114-0766 2010. Recursive triangulation description of the feasible parameter set for bounded-noise models. IET Control Theory and Applications 4 (6) , pp. 985-992. 10.1049/iet-cta.2009.0040

Full text not available from this repository.

Abstract

The problem of estimating feasible parameter sets for linear discrete-time systems with unknown-butbounded noise is investigated. Considering that the feasible parameter set of a linear discrete-time system with bounded noise is a convex polytope and that a convex polytope can be triangulated into a limited number of simplexes with good properties, the authors propose an exact triangulation description method for the feasible parameter set. A convex polytope triangulation algorithm is introduced and a recursive algorithm of estimating the feasible parameter set in correspondence with the system description is developed. Simulation examples show the effectiveness of the proposed method.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Institution of Engineering and Technology
ISSN:	1751-8644
Funders:	NSFC
Last Modified:	20 Oct 2022 08:29
URI:	https://orca.cardiff.ac.uk/id/eprint/28519

Citation Data

Cited 8 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item