Least-square identification with error bounds for real-time signal processing and control

Abstract

Set-membership (SM) identification, which refers to a class of algorithms using certain a priori knowledge about a parametric model to constrain the solutions to certain sets, is considered. The focus is on a class of SM-based techniques that are of particular interest in applications requiring real-time processing. The optimal bounding ellipsoid (OBE) algorithms are interpreted as a blending of the classical least-square error minimization approach with knowledge of bounds on model errors arising from SM considerations. Using this interpretation, a general framework embracing all currently used OBE algorithms is developed, and strategies for adaptation and for implementation on parallel machines are discussed. Computational complexity benefits are considered for the various algorithms. The treatment is tutorial, leaving many of the formal details to an appendix that presents an archival theoretical treatment of the key results. A second appendix gives an overview of current research in the general SM identification field.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>