activity
20162023
most citedHeuristics for Planning, Plan Recognition and Parsing

2 citations · 6 across the 6 of their papers we have counts for

collaborators

7 papers

cs.AI2023

Lifted Sequential Planning with Lazy Constraint Generation Solvers

Anubhav Singh, Miquel Ramirez, Nir Lipovetzky +1

This paper studies the possibilities made open by the use of Lazy Clause Generation (LCG) based approaches to Constraint Programming (CP) for tackling sequential classical planning…

cs.RO2022

Lazy Probabilistic Roadmaps Revisited

Miquel Ramirez, Daniel Selvaratnam, Chris Manzie

This paper describes a revision of the classic Lazy Probabilistic Roadmaps algorithm (Lazy PRM), that results from pairing PRM and a novel Branch-and-Cut (BC) algorithm. Cuts are d…

cs.AI2022★ 2 cited

Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning

Stefan O'Toole, Miquel Ramirez, Nir Lipovetzky +1

We introduce a new algorithm, Regression based Supervised Learning (RSL), for learning per instance Neural Network (NN) defined heuristic functions for classical planning problems.…

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.AI2017★ 2 cited

Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains

Miquel Ramirez, Enrico Scala, Patrik Haslum +1

In this paper we look into the problem of planning over hybrid domains, where change can be both discrete and instantaneous, or continuous over time. In addition, it is required th…

cs.AI2016★ 2 cited

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…