2013 American Control Conference 2013
DOI: 10.1109/acc.2013.6579860
|View full text |Cite
|
Sign up to set email alerts
|

Reduced complexity dynamic programming solution for Kalman filtering of linear discrete time descriptor systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…However, intelligent management of the inequality constraints can be achieved using similar techniques to the ones presented in this paper. This and other problems involving 1 and Huber penalties will be subjects for future studies.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…However, intelligent management of the inequality constraints can be achieved using similar techniques to the ones presented in this paper. This and other problems involving 1 and Huber penalties will be subjects for future studies.…”
Section: Resultsmentioning
confidence: 99%
“…Descriptor Kalman recursions were previously derived in [12] and [20] with the most general case derived in [25]. Descriptor Kalman recursions for the case when mixed stochastic and deterministic components are considered can be found in [1].…”
Section: Theoremmentioning
confidence: 99%
“…Unless coupled, the larger system can be decomposed into the sum of its uncoupled subsystems, enabling major optimizations for computational complexity [10]. …”
Section: Technical Backgroundmentioning
confidence: 99%