Skip to content

Home

Jump to bottom
Thomas Keller edited this page Feb 26, 2021 · 13 revisions

Welcome

Welcome to the website of the probabilistic planning system PROST, which participated at the (fully observable) MDP track of IPC 2011 and IPC 2014 and is the base of the Prost-DD planner that participated at IPC 2018.

An overview on the algorithms used in the IPPC 2011 configuration is described in the ICAPS 2012 paper: PROST is based on the UCT algorithm, which is initialized with a iterative deepening search on a most-likely determinized simplification of the original task. The used input language is RDDL, a brief documentation of which can be found here. If you want to cite the PROST planner, this is the correct paper to do so, even though the latest version contains only few lines of code that ran already in 2011.

In 2013, the PROST planner has been extended and is now a framework that supports several planner configurations that are described in the ICAPS 2013 paper on the Trial-based Heuristic Tree Search (THTS) framework, a generalization of the well-known Monte-Carlo Tree Search framework. If you mention the algorithms that are implemented in PROST, this or Thomas' PhD thesis is most likely the correct paper to cite.

In case you have any questions about the usage of PROST, feel free to write us an email. If you encounter a bug, please check the issue-tracker and add your issue if it is not already there or leave a comment in the existing issue to let us know that the feature or bug is important to your work.

Wiki hotlinks

News

  • Prost is now released under the MIT license. (26 February 2021)
  • The RDDL parser component of the planner received a large update. An overview of the changes can be found in the changelog. Note that the installation instructions have been updated. (09 September 2020)
  • Experiments with Prost can now be performed with the lab framework, which makes it significantly easier to evaluate new planner features. For more information see the corresponding wiki page. (07 July 2020)
  • The Prost repo is now a git repo and has moved to github. (18 October 2019)
  • Prost is now built with CMake ((Issue #38). (14 September 2018)
  • Congratulations to Florian Geißer and David Speck who won the discrete MDP probabilistic track of IPC 2018 with their (Prost based) Prost-DD planner. (29 June 2018)
  • We have added a new component to the planner that reduces its dependency from rddlsim: from now on, it is possible to directly parse rddl files (without having to translate them to rddl_prefix first). Even though both parsers can be used at the moment, the rddl_prefix parser will not be maintained any longer (and will be removed eventually). (17 October 2016)
  • We moved the website and repository to be hosted at bitbucket, which provides us with an an affiliation-independent platform and also some new features like this Wiki or a proper issue-tracker. (26 August 2016)
  • Over the past few months, we have altered the planner structure significantly. It closely resembles the THTS ingredient structure with own classes for each ingredient. Most importantly, this allows to specify a large number of THTS algorithms by simply mixing and matching the corresponding ingredients. (21 December 2015)
  • Winner of IPPC2014! The IPPC 2014 results are published and we have successfully defended our title! (27 June 2014)
  • The planner has been extended to work with finite-domain variables instead of boolean ones, which allows the usage of enums (Issue #4). (20 February 2014)
  • The THTS framework and the UCT variants described have been merged into the PROST framework (Issue #6). (29 May 2013)
  • Our paper Trial-based Heuristic Tree Search for Finite Horizon MDPs, a collaboration with Malte Helmert and with experiments implemented in PROST, has been awarded the Best Student Paper Award of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013). (20 May 2013)
  • State action constraint handling has been added to the framework (Issue #2). For the first time, PROST supports a larger fragment of RDDL than the one that was used for IPPC 2011. (1 April 2013)
  • The old website "prost.informatik.uni-freiburg.de", which now redirects here, went online. (27 August 2012)
  • The PROST planner is the Winner of IPPC 2011. (14 June 2011)
Clone this wiki locally