2008
DOI: 10.1016/j.inffus.2006.10.010
|View full text |Cite
|
Sign up to set email alerts
|

Reduced-order steady-state descriptor Kalman fuser weighted by block-diagonal matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
21
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 41 publications
(21 citation statements)
references
References 15 publications
0
21
0
Order By: Relevance
“…D i (q −1 ) and Q εi can be obtained by Gevers-Wouters [9]'s iteration algorithm. From (7) and (8) we obtain the ARMA innovation model…”
Section: Local Descriptor Wiener State Estimatorsmentioning
confidence: 99%
See 1 more Smart Citation
“…D i (q −1 ) and Q εi can be obtained by Gevers-Wouters [9]'s iteration algorithm. From (7) and (8) we obtain the ARMA innovation model…”
Section: Local Descriptor Wiener State Estimatorsmentioning
confidence: 99%
“…Recently, the optimal fusion rule weighted by diagonal matrices has been presented [6], which realizes a decoupled fusion estimation for state components. Using the singular value decomposition, transforming the descriptor system into two reducedorder non-descriptor subsystems, the distributed descriptor Kalman fuser has been presented [7,8]. In this paper, for discrete linear stochastic descriptor systems with multisensor, using the modern time series analysis method [4,5], based on the autoregressive moving average (ARMA) innovation model and white noise estimators [4,5], using the optimal fusion rule weighted by diagonal matrices, a decoupled distributed descriptor Wiener state fuser is presented, which avoids the decomposition.…”
Section: Introductionmentioning
confidence: 99%
“…For the single sensor descriptor systems, there exist different approaches in the literature [48] to deal with their estimation problems. They include reduced‐order estimation methods [9, 10] and the full‐order estimation methods [1113]. Applying the reduced‐order methods [9, 10, 14], a descriptor system can be transformed into two reduced‐order normal systems by a singular value decomposition method, which can reduce computational burden, while the assumption condition of this algorithm is too rigorous.…”
Section: Introductionmentioning
confidence: 99%
“…The so‐called linearly correlated noises mean that the measurement noise is a linear function of the process noise, which are encountered frequently in practical applications. For example, using the singular value decomposition, the descriptor system can be transformed into two reduced‐order non‐singular coupled subsystems; where in the first subsystem, the measurement noise is linearly correlated with the process noise . For the system with colored measurement noise, using the measurement differencing transformation, the system can be converted into an equivalent system with linearly correlated noises .…”
Section: Introductionmentioning
confidence: 99%