Browsing by Author "Lipovetzky, Nir"

Sort by: Order: Results:

  • Balbo, Andrea Luca; Rubio-Campillo, Xavier; Rondelli, Bernardo; Ramírez, Miquel; Lancelotti, Carla; Torrano, Alexis; Salpeteur, Matthieu; Lipovetzky, Nir; Reyes-García, Victoria; Montañola, Cristina; Madella, Marco (Springer, 2014)
    Based on archaeological evidence from Kutch-Saurashtra (N Gujarat, NW India), we use agent-based modelling (ABM) to explore the persistence of hunter-gatherer (HG) groups in semi-arid environments in the mid and late ...
  • 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 ...
  • 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 ...
  • Lipovetzky, Nir (Universitat Pompeu Fabra, 2012-12-07)
    Classical planning is the problem of finding a sequence of actions for achieving a goal from an initial state assuming that actions have deterministic effects. The most effective approach for finding such plans is based ...
  • 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 ...