Problemcore
Stochastic shortest path problem
Also called SSP, Stochastic shortest paths, stochastic shortest path problem.
Find a policy minimizing expected total cost to reach a goal in an MDP.
Find a policy minimizing expected total cost to reach a goal in an MDP.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 4D16F2 Edit this page History Report an error