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

On the projection algorithm and delay of peaking in adaptive control

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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

3 Author(s)
Delyon, B. ; IRISA/INRIA, Rennes ; Izmailov, R. ; Juditsky, A.

Adaptive deadbeat control is considered for the deterministic linear plant without any persistent excitation assumption imposed. The upper bound on the rate of convergence is provided for the control algorithm that uses the projection identification algorithm. On the other hand, it is shown that convergence is delayed if the regularized identification algorithm is used. It is shown that arbitrarily large delays can precede an overshoot under certain choices of initial conditions. An estimate is also provided for the amplitude of the peak

Published in:

Automatic Control, IEEE Transactions on  (Volume:38 ,  Issue: 4 )

Date of Publication:

Apr 1993

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.