1983
DOI: 10.1016/0167-6911(83)90012-9
|View full text |Cite
|
Sign up to set email alerts
|

Causal coding and control for Markov chains

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 30 publications
(15 citation statements)
references
References 4 publications
0
15
0
Order By: Relevance
“…and let m 2 be the unique positive root of the standard DARE 2 (mab) 2 p + m(a -1) -b2 = ° q+m (11) Define the control gains kl = kl (R) and k 2 by k . --miab 1 -q+mib2 (12) and steady-state variances ai = ai(R) and a� = a�(R) by a 2 a 2 = (1 -e-2R )kiX, (1 -e-2R )e-2R k w;) , (15) and let ni = N(O,a;) for i = 1,2.…”
Section: Main Results and Some Implicationsmentioning
confidence: 99%
See 3 more Smart Citations
“…and let m 2 be the unique positive root of the standard DARE 2 (mab) 2 p + m(a -1) -b2 = ° q+m (11) Define the control gains kl = kl (R) and k 2 by k . --miab 1 -q+mib2 (12) and steady-state variances ai = ai(R) and a� = a�(R) by a 2 a 2 = (1 -e-2R )kiX, (1 -e-2R )e-2R k w;) , (15) and let ni = N(O,a;) for i = 1,2.…”
Section: Main Results and Some Implicationsmentioning
confidence: 99%
“…(11) and (12), we can show that the second term is equal to the first term, so from (14) Pa 2 1 * (0) � --. (16) …”
Section: I-amentioning
confidence: 92%
See 2 more Smart Citations
“…On the other hand, dynamic optimization problems where the DM observes the system state through an information-limited channel have been long studied by control theorists (a very partial list of references is [1,3,6,33,34,37,42]). Most of this literature focuses on the case when the channel is fixed, and the controller must be supplemented by a suitable encoder/decoder pair respecting the information constraint and any considerations of causality and delay.…”
mentioning
confidence: 99%