Welcome to the UPF Digital Repository

Browsing Congressos (Departament de Tecnologies de la Informació i les Comunicacions) by Author "Geffner, Héctor"

Browsing Congressos (Departament de Tecnologies de la Informació i les Comunicacions) by Author "Geffner, Héctor"

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 ...
  • Patrizini, Fabio; Lipovetzky, Nir; Giacomo, Giuseppe de; Geffner, Héctor (Association for the Advancement of Artificial Intelligence (AAAI), 2011)
    Classical planning has been notably successful in synthesizing finite plans to achieve states where propositional goals hold. In the last few years, classical planning has also been extended to incorporate temporally ...
  • Ramírez Jávega, Miquel; Geffner, Héctor (Association for the Advancement of Artificial Intelligence (AAAI), 2011)
    Plan recognition is the problem of inferring the goals and plans of an agent from partial observations of her behavior. Recently, it has been shown that the problem can be formulated and solved using/nplanners, reducing ...
  • Kolobov, Andrey; Mausam; Weld, Daniel S.; Geffner, Héctor (Association for the Advancement of Artificial Intelligence (AAAI), 2011)
    Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs). These are MDPs with 1) an optimal value ...
  • 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, ...
  • Francès, Guillem; Ramírez Jávega, Miquel; Lipovetzky, Nir; Geffner, Héctor (International Joint Conferences on Artificial Intelligence Organization (IJCAI), 2017)
    Classical planning is concerned with problems where a goal needs to be reached from a known initial state by doing actions with deterministic, known effects. Classical planners, however, deal only with classical problems ...
  • Lipovetzky, Nir; Geffner, Héctor (Association for the Advancement of Artificial Intelligence (AAAI), 2011)
    We define a probe to be a single action sequence computedgreedily from a given state that either terminates in the goalor fails. We show that by designing these probes carefullyusing a number of existing and new polynomial ...
  • Francès, Guillem; Geffner, Héctor (IJCAI & AAAI Press, 2016)
    Existentially quantified variables in goals and action preconditions are part of the standard PDDL planning language, yet few planners support them, while those that do compile them away at an exponential cost. In this ...
  • 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 ...
  • Geffner, Héctor; Lipovetzky, Nir (IOS Press, 2012)
    We introduce a width parameter that bounds the complexity of classical planning problems and domains, along with a simple but effective blind-search procedure that runs in time that is exponential in the problem width. We ...

Search DSpace


Advanced Search

Browse

My Account

Compliant to Partaking