Cone-bounded nonlinearities and mean-square bounds-Smoothing and prediction

  • Authors:
  • K.-P Dunn;I.B Rhodes

  • Affiliations:
  • K.-P. Dunn is with the M.I.T. Electronic Systems Laboratory (Room 35-312B), Cambridge, Massachusetts 02139, U.S.A.;I. B. Rhodes is with the Department of Systems Science and Mathematics, Washington University, St. Louis, Missouri 63130, U.S.A.

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 1975

Quantified Score

Hi-index 22.14

Visualization

Abstract

Mean-square performance bounds are derived for smoothing and prediction problems associated with the broad class of nonlinear dynamic systems which, when modeled by Ito differential equations, contain drift (.dt) coefficients which are, to within a uniformly Lipschitz residual, jointly linear in the system state and externally applied control. Included in this paper are lower bounds on the error covariance attainable by any smoother or any predictor, including the optimum, and upper bounds on the performance of some simple, implementable predictors reminiscent of the designs which are optimal in the linear case. The lower bounds on smoothing and prediction performance are established using measure-transformation techniques to relate a version of the nonlinear problem to its linearization. The upper bound on prediction performance is constructed by a direct analysis of the estimation error. All the bounds hold for correlated system and observation noises. All are rigorously derived and independent of control or control law. In each case, the computational effort is comparable to that for the corresponding optimum linear smoothing or prediction problem. The bounds converge with vanishing nonlinearity (vanishing Lipschitz constants) to the known optimum performance for the limiting linear system. Consequently, the bounds are asymptotically tight and the simple designs studied are asymptotically optimal with vanishing nonlinearity.