Browsing by Author "Bonet, Blai"

Sort by: Order: Results:

  • Bonet, Blai; Geffner, Héctor (Association for the Advancement of Artificial Intelligence (AAAI), 2012)
    In the presence of non-admissible heuristics, A* and other best-first algorithms can be converted into anytime optimal algorithms over OR graphs, by simply continuing the search after the first solution is found. The ...
  • Bonet, Blai; Geffner, Héctor (Elsevier, 2008)
    The automatic derivation of heuristic functions for guiding the search for plans is a fundamental technique in planning. The type of heuristics that have been considered so far, however, deal only with simple planning ...
  • Bonet, Blai; Geffner, Héctor (Association for the Advancement of Artificial Intelligence (AAAI), 2005)
    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 ...
  • Bonet, Blai; Geffner, Héctor (Elsevier, 2001)
    In the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and sat planners. Heuristic search planners like hsp transform planning problems into ...
  • Bonet, Blai; Geffner, Héctor (Association for the Advancement of Artificial Intelligence (AAAI), 2011)
    Planning with partial observability can be formulated as a non-deterministic search problem in belief space. The problem is harder than classical planning as keeping track of beliefs is harder than keeping track of states, ...
  • Bonet, Blai; Geffner, Héctor (Association for the Advancement of Artificial Intelligence (AAAI), 2012)
    It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and small. In this work, we introduce a new ...