Search Results for author:
Found 2 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.
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
