1994
DOI: 10.1109/9.328818
|View full text |Cite
|
Sign up to set email alerts
|

Optimal state estimation without the requirement of a priori statistics information of the initial state

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2000
2000
2016
2016

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 32 publications
(9 citation statements)
references
References 10 publications
0
9
0
Order By: Relevance
“…Consider now the problem of minimizing JFH(X, Ut,t+N-l, N) subject to (1), (2) and when A is nonsingular can be found in [22], [3] . If A is singular, K ZS can be computed by dualizing the filtering results reported in [12]. It is interesting to note that K ZS can be seen as the optimal LQ gain associated with a "fake" cost function…”
Section: The Zero-state Terminal Constraint (Zs)mentioning
confidence: 99%
See 1 more Smart Citation
“…Consider now the problem of minimizing JFH(X, Ut,t+N-l, N) subject to (1), (2) and when A is nonsingular can be found in [22], [3] . If A is singular, K ZS can be computed by dualizing the filtering results reported in [12]. It is interesting to note that K ZS can be seen as the optimal LQ gain associated with a "fake" cost function…”
Section: The Zero-state Terminal Constraint (Zs)mentioning
confidence: 99%
“…Associated with (11), (12) it is possible to define an RH (Receding Horizon) control strategy in the usual way: at every time instant t, define x = x(t) and compute the optimal solution U~,t+N-l for the FH problem (11) subject to (1), (2), (12); then apply the control u(t) = UO(x) where UO(x) is the first column of U~,t+N-l' Although the F H minimization of (11) has to be performed at each time instant, this is much more viable than solving an I H problem.…”
Section: Nonlinear Rh Controlmentioning
confidence: 99%
“…If to take into account constraint (18), provide the averaging, and rearrange the terms, (25) can be transformed to…”
Section: The Gain For Ofir-eu Filtermentioning
confidence: 99%
“…Nowadays, the interest to FIR estimators has grown owing to the tremendous progress in the computational resources. Accordingly, we find a number of new solutions on FIR filtering [16][17][18][19][20][21], smoothing [22][23][24], and prediction [25][26][27] as well as efficient applications [28][29][30].…”
Section: Introductionmentioning
confidence: 99%
“…The computational burden associated with large dimensions of vectors and matrices [7,8], which cause slow operation, makes the batch FIR estimator highly unattractive for engineering applications, that is, in spite of its inherent bounded input/bounded output stability [9], better robustness [7,10], and lower sensitivity to noise [11] against the Kalman filter (KF). The tremendous progress in the computational resources did not bring about essential change, and the batch FIR estimators [12][13][14][15][16][17][18][19][20][21] still remain mostly on a theoretical level.…”
Section: Introductionmentioning
confidence: 99%