Papers
Topics
Authors
Recent
2000 character limit reached

Adaptive Identification with Guaranteed Performance Under Saturated-Observation and Non-Persistent Excitation (2207.02422v5)

Published 6 Jul 2022 in eess.SY, cs.SY, and eess.SP

Abstract: This paper investigates the adaptive identification and prediction problems for stochastic dynamical systems with saturated observations, which arise from various fields in engineering and social systems, but up to now still lack comprehensive theoretical studies including performance guarantees needed in practical applications. With this impetus, the paper has made the following main contributions: (i) To introduce a two-step Quasi-Newton (TSQN) algorithm to improve the performance of the identification, which is applicable to a typical class of nonlinear stochastic systems with outputs observed under possibly varying saturation. (ii) To establish the global convergence of both the parameter estimators and adaptive predictors and to prove the asymptotic normality, under the weakest possible non-persistent excitation (PE) condition, which can be applied to stochastic feedback systems with general non-stationary and correlated system signals or data. (iii) To establish useful probabilistic estimation error bounds for any given finite length of data, using either martingale inequalities or Monte Carlo experiments. A numerical example is also provided to illustrate the performance of the proposed identification algorithm.

Citations (5)

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.