Non-Markovian policies in sequential decision problems
In this article we prove the validity of the Bellman Optimality Equation and related results for sequential decision problems with a general recursive structure. The characteristic feature of our approach is that also nonMarkovian policies are taken into account. The theory is motivated by some expe...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1998
|
| Sorozat: | Acta cybernetica
13 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12592 |
| LEADER | 01080nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12592 | ||
| 005 | 20220613155617.0 | ||
| 008 | 161015s1998 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Szepesvári Csaba | |
| 245 | 1 | 0 | |a Non-Markovian policies in sequential decision problems |h [elektronikus dokumentum] / |c Szepesvári Csaba |
| 260 | |c 1998 | ||
| 300 | |a 305-318 | ||
| 490 | 0 | |a Acta cybernetica |v 13 No. 3 | |
| 520 | 3 | |a In this article we prove the validity of the Bellman Optimality Equation and related results for sequential decision problems with a general recursive structure. The characteristic feature of our approach is that also nonMarkovian policies are taken into account. The theory is motivated by some experiments with a learning robot. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12592/1/cybernetica_013_numb_003_305-318.pdf |z Dokumentum-elérés |