Bonet, BlaiGeffner, HéctorUniversitat Pompeu Fabra2013-01-112013-01-112005Bonet B, Geffner H. mGPT: a probabilistic planner based on heuristic search. J Artif Intell Res. 2005; 24: 933-44. DOI: 10.1613/jair.16881076-9757http://hdl.handle.net/10230/20060We describe the version of the GPT planner to be used in the planning competition. This version, called mGPT, solves mdps specified in the ppddl/nlanguage by extracting and using different classes of lower bounds, along with various heuristic-search /nalgorithms. The lower bounds are extracted from deterministic relaxations of the mdp where alternative/nprobabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms, on the other hand, use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state with the greedy policy.11 p.application/pdfeng© 2005, Association for the Advancement of Artificial Intelligence (www.aaai.org)Planificació -- Informàticainfo:eu-repo/semantics/articlehttp://dx.doi.org/10.1613/jair.1688info:eu-repo/semantics/openAccess