Abstract
Identification of time-varying systems, especially slowly time-varying systems, is of importance in the development of a comprehensive theory of adaptation. The persistent identification measures employed in this paper capture a main characterization in such identification problems, namely, one input signal must be used for identification of all possible observation windows. This paper establishes several essential features in persistent identification problems which highlight their potential utility in adaptation: 1) they have computable upper and lower bounds for typical classes of prior uncertainty sets; 2) any full rank n-periodic signals are optimal, and the simple least-squares estimates are optimal identification algorithms; 3) optimal probing inputs can be approximately generated in a closed-loop configuration when the plant and the controller are slowly time-varying; and 4) n-periodic signals are asymptotically optimal for slowly time-varying systems. The main results of this paper have been successfully combined with a certain slow H/sup /spl infin// design to derive an adaptive stabilization scheme.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
