Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Optimal bounding error algorithms with adaptive tracking capability

By: Deller, J.R.; Nayeri, M.; Liu, M.S.;

1992 / IEEE / 0-8186-3160-0


This item was taken from the IEEE Periodical ' Optimal bounding error algorithms with adaptive tracking capability ' A class of set membership (SM)-based techniques which are of particular interest in applications requiring real-time identification is considered. 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. Various adaptive strategies are discussed. It is shown that the adaptive OBE algorithms are more effective in tracking time-varying systems than least squares techniques.<>