Q-learning and policy iteration algorithms for stochastic shortest path problems (Q378731): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6225970 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Markov decision processes | |||
Property / zbMATH Keywords: Markov decision processes / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Q-learning | |||
Property / zbMATH Keywords: Q-learning / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximate dynamic programming | |||
Property / zbMATH Keywords: approximate dynamic programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
value iteration | |||
Property / zbMATH Keywords: value iteration / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
policy iteration | |||
Property / zbMATH Keywords: policy iteration / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
stochastic shortest paths | |||
Property / zbMATH Keywords: stochastic shortest paths / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
stochastic approximation | |||
Property / zbMATH Keywords: stochastic approximation / rank | |||
Normal rank |
Revision as of 11:12, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Q-learning and policy iteration algorithms for stochastic shortest path problems |
scientific article |
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