Search Results for author:
Found 7 papers, 0 papers with code
Lifted Sequential Planning with Lazy Constraint Generation Solvers
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.
Lazy Probabilistic Roadmaps Revisited
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.
Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning
We introduce a new algorithm, Regression based Supervised Learning (RSL), for learning per instance Neural Network (NN) defined heuristic functions for classical planning problems.
Width-based Lookaheads with Learnt Base Policies and Heuristics Over the Atari-2600 Benchmark
We propose new width-based planning and learning algorithms inspired from a careful analysis of the design decisions made by previous width-based planners.
Approximate Novelty Search
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.
Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains
FS+ is shown to be a robust planner over a diverse set of hybrid domains, taken from the existing literature on hybrid planning and systems.
Heuristics for Planning, Plan Recognition and Parsing
In a recent paper, we have shown that Plan Recognition over STRIPS can be formulated and solved using Classical Planning heuristics and algorithms.
