Visualitza per autor "Geffner, Héctor"

Ordena per: Ordre: Resultats:

  • 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 ...
  • 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 ...
  • Keyder, Emil Ragip (Universitat Pompeu Fabra, 2010-12-17)
    Classical planning is the problem of nding a sequence of actions that takean agent from an initial state to a desired goal situation, assuming deter-ministic outcomes for actions and perfect information. Satis cing ...
  • Ramírez Jávega, Miquel (Universitat Pompeu Fabra, 2012-05-17)
    Plan recognition is the problem of inferring the goals and plans of an agent after partiallyobserving its behavior. This is the inverse of planning, the problem of findingthe actions that need to be done in order to achieve ...
  • 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, ...
  • Lipovetzky, Nir (Universitat Pompeu Fabra, 2012-12-07)
    Classical planning is the problem of finding a sequence of actions forachieving a goal from an initial state assuming that actions havedeterministic effects. The most effective approach for finding suchplans is based on ...
  • Albore, Alexandre (Universitat Pompeu Fabra, 2012-02-22)
    Artificial Intelligence Planning is about acting in order to achieve a desired goal. Under incomplete information, the task of finding the actions needed to achieve the goal can be modelled as a search problem in the belief ...
  • Palacios Verdes, Héctor Luis (Universitat Pompeu Fabra, 2009-12-03)
    Conformant planning is the problem of finding a sequence of actions for achieving a goal in the presence of uncertainty in the initial state and state transitions. While few practical problems are purely conformant, ...
  • 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 ...