A general approach to constructing parameter identification algorithms in the class of square root filters with orthogonal and J-orthogonal tranformations

We study modern implementations of the discrete Kalman filter, namely array square-root algorithms. An important feature of such algorithms is the use of orthogonal and J -orthogonal transformations on each filtering step. For the first time, we develop for this class of algorithms a simple universa...

Full description

Saved in:
Bibliographic Details
Published in:Automation and remote control Vol. 75; no. 8; pp. 1402 - 1419
Main Authors: Kulikova, M. V., Tsyganova, Yu. V.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01.08.2014
Subjects:
CAE) and Design
Calculus of Variations and Optimal Control; Optimization
Computer-Aided Engineering (CAD
Control
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Queueing Systems
Robotics
Stochastic Systems
Systems Theory
Fisher Information Matrix
Orthogonal Transformation
Triangular Form
Remote Control
Sensitivity Equation
ISSN:0005-1179, 1608-3032
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study modern implementations of the discrete Kalman filter, namely array square-root algorithms. An important feature of such algorithms is the use of orthogonal and J -orthogonal transformations on each filtering step. For the first time, we develop for this class of algorithms a simple universal approach that lets us generalize any numerically stable implementation of this type to the case of updates in sensitivity equations of the filter with respect to unknown system model parameters. An advantage of the resulting adaptive schemes is their numerical stability with respect to machine rounding errors. Estimation of the noisy state vector of the system and identification of unknown system parameters occur simultaneously. The proposed approach can be used for parameter identification problems, adaptive control problems, experiment planning, and others.
ISSN:0005-1179
1608-3032
DOI:10.1134/S0005117914080050