en-de
en-es
en-fr
en-pt
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
Heuristic Search for Generalized Stochastic Shortest Path MDPs
Published on Jul 21, 20113759 Views
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs). These are MDPs wi
Related categories
Chapter list
Heuristic Search for Generalized Stochastic Shortest Path MDPs00:00
Discrete MDP Research So Far00:00
Interesting Problems Outside SSP01:02
Outline (1)02:23
Why Is SSP≠GOMDP?02:53
Why Is SSP≠ GOMDP: Example04:33
Introducing Generalized SSPs05:13
Generalized SSPs: Definition05:23
Generalized SSPs: Example (1)06:13
Generalized SSPs: Example (2)06:56
Outline (2)08:12
Digression: Heuristic Search for SSPs (1)08:23
Digression: Heuristic Search for SSPs (2)09:18
Digression: Heuristic Search for SSPs (3)09:57
Efficiently Solving GSSPs: Attempt #110:42
Efficiently Solving GSSPs: Attempt #211:41
Attempt #2: What Went Wrong?11:59
Efficiently Solving GSSPs: FRET13:27
FRET Example: Finding V*14:26
FRET Example: Extracting Π* (1)16:01
FRET Example: Extracting Π* (2)16:24
Why Does FRET It Work?16:53
Outline (3)17:22
Experimental Setup (1)17:23
Experimental Setup (2)18:10
Outline (4)18:35
Future Work (1)18:37
Future Work (2)18:44
Conclusions18:55
Questions?19:30