Q-learning and policy iteration algorithms for stochastic shortest path problems (Q378731)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Q-learning and policy iteration algorithms for stochastic shortest path problems |
scientific article; zbMATH DE number 6225970
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Q-learning and policy iteration algorithms for stochastic shortest path problems |
scientific article; zbMATH DE number 6225970 |
Statements
Q-learning and policy iteration algorithms for stochastic shortest path problems (English)
0 references
12 November 2013
0 references
Markov decision processes
0 references
Q-learning
0 references
approximate dynamic programming
0 references
value iteration
0 references
policy iteration
0 references
stochastic shortest paths
0 references
stochastic approximation
0 references
0 references
0 references
0.8744655251502991
0 references
0.8454617857933044
0 references
0.7942298054695129
0 references
0.7942298054695129
0 references
0.7927683591842651
0 references
