Robust filtering and prediction for systems with embedded finite-state Markov-Chain dynamics

Thesis/Dissertation · Wed Jan 01 04:00:00 EST 1986

OSTI ID:5223719

Pate, E B

This research developed new methodologies for the design of robust near-optimal filters/predictors for a class of system models that exhibit embedded finite-state Markov-chain dynamics. These methodologies are developed through the concepts and methods of stochastic model building (including time-series analysis), game theory, decision theory, and filtering/prediction for linear dynamic systems. The methodology is based on the relationship between the robustness of a class of time-series models and quantization which is applied to the time series as part of the model identification process. This relationship is exploited by utilizing the concept of an equivalence, through invariance of spectra, between the class of Markov-chain models and the class of autoregressive moving average (ARMA) models. This spectral equivalence permits a straightforward implementation of the desirable robust properties of the Markov-chain approximation in a class of models which may be applied in linear-recursive form in a linear Kalman filter/predictor structure. The linear filter/predictor structure is shown to provide asymptotically optimal estimates of states which represent one or more integrations of the Markov-chain state. The development of a new saddle-point theorem for a game based on the Markov-chain model structure gives rise to a technique for determining a worst case Markov-chain process, upon which a robust filter/predictor design if based.

• Research Organization: Pennsylvania Univ., Philadelphia (USA)
• OSTI ID: 5223719
• Country of Publication: United States
• Language: English

Related Subjects

657000* -- Theoretical & Mathematical Physics
71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ASYMPTOTIC SOLUTIONS
DIGITAL FILTERS
MARKOV PROCESS
MATHEMATICS
QUANTIZATION
SADDLE-POINT METHOD
STOCHASTIC PROCESSES
TIME-SERIES ANALYSIS