Indirect stochastic adaptive control: The general delay-white noise case
IEEE Transactions on Automatic ControlPublished 1 February 1982
J.-J. Fuchs
Citations29
SJR quartileQ1
SJR score3.80
SNIP2.59
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work shows that in the white noise case a single adaptation algorithm suffices to establish that, with probability one, the systems input, output and the output tracking error are sample mean-square bounded.
Abstract
Recent papers on adaptive stochastic control have established global convergence for the general delay-colored noise case. However, for delays k greater than unity they require the implementation of k interlaced adaptation algorithms. Using an indirect adaptive control approach, we show that in the white noise case a single adaptation algorithm suffices to establish that, with probability one, the systems input, output and the output tracking error are sample mean-square bounded. Moreover, the conditional variance of the output tracking error is shown to converge to its global minimum value with probability one.
Keywords
Computer ScienceDecision SciencesEngineering
IEEE Transactions on Automatic ControlDiscrete-time multivariable adaptive control
924 Citations1980Graham C. Goodwin, Peter J. Ramadge +1 more
AutomaticaTheory and applications of self-tuning regulators
649 Citations1977Karl Johan Åström, Ulf Borisson +2 more
The regulator algorithms, their theory and industrial applications are reviewed and the major ideas are covered but detailed analysis is given elsewhere.
SIAM Journal on Control and OptimizationDiscrete Time Stochastic Adaptive Control
433 Citations1981Graham C. Goodwin, Peter J. Ramadge +1 more
IEEE Transactions on Automatic ControlOn positive real transfer functions and the convergence of some recursive schemes
404 Citations1977Lennart Ljung
The convergence with probability one of a recently suggested recursive identification method by Landau is investigated and the positive realness of a certain transfer function is shown to play a crucial role, both for the proof of convergence and for convergence itself.
IEEE Transactions on Automatic ControlThe convergence of AML
253 Citations1979Victor Solo
It is shown that provided a certain positive real condition is satisfied, the AML recursion for the parameters of a scalar ARMAX time series model converges with probability one without the need of monitoring.
AutomaticaStochastic adaptive control using a modified least squares algorithm
121 Citations1982Kwai Sin, Graham C. Goodwin
It is shown that, with probability one, the algorithm will ensure that the system inputs and outputs are sample mean square bounded and the mean square output tracking error achieves its global minimum possible value for linear feedback control.
IEEE Transactions on Automatic ControlStochastic adaptive control and prediction--The general delay-colored noise case
64 Citations1980Graham C. Goodwin, Kwai Sin +1 more
The general delay-white noise case and the unit delay-colored noise case are treated and a slightly different proof technique is used which relies only upon elementary analysis and is thus of pedagogical interest.
IEE Proceedings D Control Theory and ApplicationsExplicit self-tuning methods
36 Citations1980J.-J. Fuchs
A general scheme, which allows the analysis of self-tuning controllers of linear systems with constant but unkonwn parameters, is presented and it is shown that any identification algorithm satisfying the previously obtained properties leads to an overall adaptive system stable in some satisfactory stochastic sense.
Discrete time stochastic adaptive control
33 Citations1979Graham C. Goodwin, Peter J. Ramadge +1 more
It is shown that, with probability one, the algorithm will ensure the system inputs and outputs are sample mean square bounded and the mean square output tracking error achieves its global minimum possible value for linear feedback control.
The Annals of ProbabilityA Short Note on the Conditional Borel-Cantelli Lemma
27 Citations1978Louis H. Y. Chen
IEEE Transactions on Automatic ControlAn adaptive d-step ahead predictor based on least squares
24 Citations1980Kwai Sin, Graham C. Goodwin +1 more
An adaptive d-step ahead predictor based on least squares
15 Citations1980Kwai Sin, Graham C. Goodwin +1 more
This paper examines the asymptotic properties of a least squares algorithm for adaptively calculating a d-step ahead prediction of a time series and shows that the sample mean square difference between the recursive prediction and the optimal linear prediction converges to zero.
IEE Proceedings D Control Theory and ApplicationsRecursive least-squares algorithm revisited
10 Citations1981Jean–Jacques Fuchs
Springer series in statisticsDiscrete Parameter Martingales
5 Citations1992Petar Todorović́
This section explores briefly some basic properties of this conditional expectation with respect to a σ-algebra, which are needed in this chapter.
Recursive least-squares algorithm revisited
5 Citations1981Jean–Jacques Fuchs
A modified form of the recursive least-squares algorithm is proposed that possesses interesting properties that are valid without any restriction on experimental conditions, or stability assumptions, and is thus especially well suited for adaptive control schemes.