3 papers
cs.AI2021
Width-based Lookaheads with Learnt Base Policies and Heuristics Over the Atari-2600 Benchmark
Stefan O'Toole, Nir Lipovetzky, Miquel Ramirez +1
We propose new width-based planning and learning algorithms inspired from a careful analysis of the design decisions made by previous width-based planners. The algorithms are appli…
cs.AI2021
Approximate Novelty Search
Anubhav Singh, Nir Lipovetzky, Miquel Ramirez +1
Width-based search algorithms seek plans by prioritizing states according to a suitably defined measure of novelty, that maps states into a set of novelty categories. Space and tim…
cs.AI2016
Heuristics for Planning, Plan Recognition and Parsing
Miquel Ramirez, Hector Geffner
In a recent paper, we have shown that Plan Recognition over STRIPS can be formulated and solved using Classical Planning heuristics and algorithms. In this work, we show that this…