The Glutton Planner
Description
Glutton is a solver for finite-horizon MDPs with large branching factors, built by Andrey Kolobov, Peng Dai, Mausam, and Dan Weld. It participated in the 2011 International Probabilistic Planning Competition (IPPC-2011) and came in second place out of five entries in that contest. There is also a more recent version of Glutton, called Gourmand, that generally performs even better.
Source code
A Glutton implementation for Linux is available as part of G-pack. By downloading, using, or redistributing this software or its parts in any way, you automatically accept its license agreement.
For instructions on how to compile and run Glutton, please see the README file included with G-pack's source code.
Publications about Glutton and its versions
-
LRTDP vs. UCT for Online Probabilistic Planning.
Andrey Kolobov, Mausam, and Daniel Weld. AAAI'12.
PDF -
Reverse Iterative Deepening for Finite-Horizon MDPs with Large Branching Factors.
Andrey Kolobov, Peng Dai, Mausam, and Daniel Weld. ICAPS'12.
PDF
Relevant links
- Gourmand, a further development of Glutton.
- PROST, a planning system by Thomas Keller and Patrick Eyerich from the University of Freiburg that won IPPC-2011.
- rddlsim, a toolkit by Scott Sanner that contains an implementation of the IPPC-2011 problem server and other useful utilities.
- miniGPT, a software package by Blai Bonet and Hector Geffner implementing several older planners, including LRTDP. G-pack borrows some of the code from it.