1983 American Control Conference 1983
DOI: 10.23919/acc.1983.4788212
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic Recovery for Discrete-Time Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
59
0

Year Published

1984
1984
2011
2011

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(61 citation statements)
references
References 2 publications
2
59
0
Order By: Relevance
“…The results show that the smoother of Method 1 provided the best overall performance. Variants of these one-step smoothing algorithms have been used in conjunction with IMM filtering algorithms to develop techniques for the alignment of asynchronous sensors [ 6 ] . Finally, approaches similar to the ones presented in this paper have been applied to the fixed-interval smoothing problem for Markovian switching systems ~71.…”
Section: Discussionmentioning
confidence: 99%
“…The results show that the smoother of Method 1 provided the best overall performance. Variants of these one-step smoothing algorithms have been used in conjunction with IMM filtering algorithms to develop techniques for the alignment of asynchronous sensors [ 6 ] . Finally, approaches similar to the ones presented in this paper have been applied to the fixed-interval smoothing problem for Markovian switching systems ~71.…”
Section: Discussionmentioning
confidence: 99%
“…Under appropriate hypotheses, the solution to the cheap control problem has appealing special properties [6].…”
Section: The Discrete Time Lqg Control Problemmentioning
confidence: 99%
“…The fact that the Riccati equation for discrete-time cheap optimal control has a parametric solutionX = c T c may be not well-known, I suppose, but can be seen in the literature published in the middle of 80s [29], [30]. As mentioned above, nonuniqueness of positive semi-definite solution is the most significant contrast to the standard case.…”
Section: Theoremmentioning
confidence: 99%
“…From (18), one can computeR,Ā and v by (11), (23) and (14), respectively. This gives the coefficient matrices in (29). A numerical computation shows that (29) for γ = 0.009 is feasible 3 .…”
Section: Lemma 1 Letmentioning
confidence: 99%