Exponential convergence and persistent excitation

Brian Anderson

doi:10.1109/CDC.1982.268393

Exponential convergence and persistent excitation

Brian Anderson

School of Engineering

Research output: Contribution to conference › Paper › peer-review

Abstract

The notion of robustness of an adaptive algorithm is discussed. A number of simple examples are given of adaptive algorithms behaving in a nonrobust manner, and then conditions for robustness are presented which demand use of persistently exciting signals.

Original language	English
Pages	12-17
Number of pages	6
DOIs	https://doi.org/10.1109/CDC.1982.268393
Publication status	Published - 1982
Event	21st IEEE Conference on Decision and Control - Holiday Inn-International Drive, Orlando, United States Duration: 8 Dec 1982 → 10 Dec 1982

Conference

Conference	21st IEEE Conference on Decision and Control
Country/Territory	United States
City	Orlando
Period	8/12/82 → 10/12/82

Access to Document

10.1109/CDC.1982.268393

Cite this

@conference{cf406fad22c34fdd9299397906b6732c,

title = "Exponential convergence and persistent excitation",

abstract = "The notion of robustness of an adaptive algorithm is discussed. A number of simple examples are given of adaptive algorithms behaving in a nonrobust manner, and then conditions for robustness are presented which demand use of persistently exciting signals.",

author = "Brian Anderson",

year = "1982",

doi = "10.1109/CDC.1982.268393",

language = "English",

pages = "12--17",

note = "21st IEEE Conference on Decision and Control ; Conference date: 08-12-1982 Through 10-12-1982",

}

TY - CONF

T1 - Exponential convergence and persistent excitation

AU - Anderson, Brian

PY - 1982

Y1 - 1982

N2 - The notion of robustness of an adaptive algorithm is discussed. A number of simple examples are given of adaptive algorithms behaving in a nonrobust manner, and then conditions for robustness are presented which demand use of persistently exciting signals.

AB - The notion of robustness of an adaptive algorithm is discussed. A number of simple examples are given of adaptive algorithms behaving in a nonrobust manner, and then conditions for robustness are presented which demand use of persistently exciting signals.

U2 - 10.1109/CDC.1982.268393

DO - 10.1109/CDC.1982.268393

M3 - Paper

SP - 12

EP - 17

T2 - 21st IEEE Conference on Decision and Control

Y2 - 8 December 1982 through 10 December 1982

ER -