Cart (Loading....) | Create Account
Close category search window
 

On the time complexity of worst-case system identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Poolla, K. ; Dept. of Mech. Eng., California Univ., Berkeley, CA, USA ; Tikku, A.

In this paper we treat a general worst-case system identification problem. This problem is worst-case with respect to both noise and system modeling uncertainty. We consider this problem under various a priori information structures. We determine bounds on the minimum duration identification experiment that must be run to identify the plant to within a specified guaranteed worst-case error bound. Our results are algorithm independent. We show that this minimum duration is prohibitively long. Based on our results, we suggest that worst-case (with respect to noise) system identification requires unrealistic amounts of experimental data

Published in:

Automatic Control, IEEE Transactions on  (Volume:39 ,  Issue: 5 )

Date of Publication:

May 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.