Bursting scenaria in adaptive algorithms: Performance limitations and some remedies

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 - 1997

Fingerprint

Bursting
Adaptive algorithms
Adaptive Algorithm
Worst-case Performance
System Identification
Burst
Adaptive Control
Parameter estimation
Parameter Estimation
Identification (control systems)
Excitation
Sufficient
Lower bound
Perturbation
Scenarios
Class
Design

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Control and Systems Engineering

Cite this

Bursting scenaria in adaptive algorithms : Performance limitations and some remedies. / Tsakalis, Konstantinos.

In: Kybernetika, Vol. 33, No. 1, 1997, p. 17-40.

Research output: Contribution to journalArticle

@article{d2fd14af28e543e3bec92e6627f06d05,
title = "Bursting scenaria in adaptive algorithms: Performance limitations and some remedies",
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.",
author = "Konstantinos Tsakalis",
year = "1997",
language = "English (US)",
volume = "33",
pages = "17--40",
journal = "Kybernetika",
issn = "0023-5954",
publisher = "Academy of Sciences of the Czech Republic",
number = "1",

}

TY - JOUR

T1 - Bursting scenaria in adaptive algorithms

T2 - Performance limitations and some remedies

AU - Tsakalis, Konstantinos

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0012205365&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0012205365&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0012205365

VL - 33

SP - 17

EP - 40

JO - Kybernetika

JF - Kybernetika

SN - 0023-5954

IS - 1

ER -