====== Talks on Probabilistic Planning ======

In these talks we consider the problem of planning on probabilistic systems in order to satisfy given properties or optimizing some reward.[[start|Back to Start page]]
----
^Title ^ Authors ^ Reference Papers ^
|RDDL language description|Scott Sanner|{{:competitions:rddl.pdf|RDDL}}, {{:competitions:rddl-slides.pdf|Sanner's slides}}|
|Trial-based Heuristic Tree Search for Finite Horizon MDPs| |{{:competitions:keller-helmert-icaps2013.pdf|THTS(long version)}}, {{:Competitions:keller-helmert-rldm2013.pdf|THTS(short version)}}, {{:Competitions:keller-eyerich-icaps2012.pdf|PROST paper}}|
|Gourmand and UCT|   |{{:Competitions:keller-eyerich-icaps2012.pdf|UCT/PROST}},  {{:competitions:gourmand.pdf|Gourmand}}|
|Plannig with first-order TEP goals|J.A. Baier and S. A. McIlraith|{{:Papers:bai-mci-aaai06.pdf|paper}}|