Robust Recursive Least-Squares Predictor with Covariance Information in Linear Continuous-Time Stochastic Systems with Uncertainties

This paper presents, in Theorem 1, the robust recursive least-squares (RLS) prediction and filtering algorithm for the signal and the nominal system state (SS). The algorithm uses cross-covariance (CC) information between the nominal and degraded SS, as well as auto-covariance (AC) information for the degraded SS, both expressed in semi-degenerate kernel forms. The algorithm also utilizes the observation matrices for the system and the degraded system, as well as the variance of the white Gaussian observation noise (WGON). A recursive algorithm for the prediction error variance function of the robust RLS predictor in Theorem 1 is presented. Based on the robust RLS prediction and filtering algorithm in Theorem 1, Theorem 2 presents the robust RLS Wiener prediction and filtering algorithm. This algorithm utilizes the corresponding system and observation matrices in both nominal and degraded systems, the cross-variance (CV) function between the nominal SS and the degraded SS, the auto-variance (AV) function of the degraded SS, and the variance of the WGON. A numerical simulation example illustrates the efficacy of the robust RLS prediction and filtering algorithm proposed in Theorem 1. The proposed robust predictor and filter demonstrate improved estimation accuracy compared to the existing RLS predictor and filter, which use covariance information.

Authors

Institutions

Publication Details

Journal
WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL
Published
2026-10-13
DOI
https://doi.org/10.37394/23203.2026.21.35
Primary Topic
Control Systems and Identification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust Recursive Least-Squares Predictor with Covariance Information in Linear Continuous-Time Stochastic Systems with Uncertainties

Seiichi Nakamori
WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL
Control Systems and Identification
article

Robust Recursive Least-Squares Predictor with Covariance Information in Linear Continuous-Time Stochastic Systems with Uncertainties

Seiichi Nakamori
article en

Abstract

This paper presents, in Theorem 1, the robust recursive least-squares (RLS) prediction and filtering algorithm for the signal and the nominal system state (SS). The algorithm uses cross-covariance (CC) information between the nominal and degraded SS, as well as auto-covariance (AC) information for the degraded SS, both expressed in semi-degenerate kernel forms. The algorithm also utilizes the observation matrices for the system and the degraded system, as well as the variance of the white Gaussian observation noise (WGON). A recursive algorithm for the prediction error variance function of the robust RLS predictor in Theorem 1 is presented. Based on the robust RLS prediction and filtering algorithm in Theorem 1, Theorem 2 presents the robust RLS Wiener prediction and filtering algorithm. This algorithm utilizes the corresponding system and observation matrices in both nominal and degraded systems, the cross-variance (CV) function between the nominal SS and the degraded SS, the auto-variance (AV) function of the degraded SS, and the variance of the WGON. A numerical simulation example illustrates the efficacy of the robust RLS prediction and filtering algorithm proposed in Theorem 1. The proposed robust predictor and filter demonstrate improved estimation accuracy compared to the existing RLS predictor and filter, which use covariance information.

WSEAS TRANSACTIONS ON SYSTEMS AND CONTROLVol. 21
Kagoshima University (JP)
Openalex Percentile: Top 17%
Control Systems and Identification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.