Bursting scenaria in adaptive algorithms: Performance limitations and some remedies

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

A simple, yet general, bursting scenario is presented for a wide class of parameter estimation and system identification algorithms in the absence of sufficient excitation. This allows for an analytical derivation of a lower bound on the worst-case performance of such algorithms in the presence of perturbations. A simple example is constructed to illustrate the implications of these results in adaptive control and interpret the design some burst suppression mechanisms.

Original languageEnglish (US)
Pages (from-to)17-40
Number of pages24
JournalKybernetika
Volume33
Issue number1
StatePublished - Dec 1 1997

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Information Systems
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Bursting scenaria in adaptive algorithms: Performance limitations and some remedies'. Together they form a unique fingerprint.

  • Cite this