mGPT: a probabilistic planner based on heuristic search

Mostra el registre complet Registre parcial de l'ítem

  • dc.contributor.author Bonet, Blaica
  • dc.contributor.author Geffner, Héctorca
  • dc.contributor.other Universitat Pompeu Fabraca
  • dc.date.accessioned 2013-01-11T10:59:49Z
  • dc.date.available 2013-01-11T10:59:49Z
  • dc.date.issued 2005ca
  • dc.description.abstract We 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.en
  • dc.format.extent 11 p.
  • dc.format.mimetype application/pdfca
  • dc.identifier.citation Bonet B, Geffner H. mGPT: a probabilistic planner based on heuristic search. J Artif Intell Res. 2005; 24: 933-44. DOI: 10.1613/jair.1688ca
  • dc.identifier.doi http://dx.doi.org/10.1613/jair.1688
  • dc.identifier.issn 1076-9757ca
  • dc.identifier.uri http://hdl.handle.net/10230/20060
  • dc.language.iso engca
  • dc.publisher Association for the Advancement of Artificial Intelligence (AAAI)ca
  • dc.relation.ispartof Journal of Artificial Intelligence Research. 2005; 24: 933-944
  • dc.rights © 2005, Association for the Advancement of Artificial Intelligence (www.aaai.org)ca
  • dc.rights.accessRights info:eu-repo/semantics/openAccess
  • dc.subject.other Planificació -- Informàticaca
  • dc.title mGPT: a probabilistic planner based on heuristic searchca
  • dc.type info:eu-repo/semantics/articleca
  • dc.type.version info:eu-repo/semantics/acceptedVersionca