research
∙
06/20/2023
Plausibility-Based Heuristics for Latent Space Classical Planning
Recent work on LatPlan has shown that it is possible to learn models for...
share
research
∙
06/30/2021
Classical Planning in Deep Latent Space
Current domain-independent, classical planners require symbolic models o...
research
∙
10/05/2020
TPAM: A Simulation-Based Model for Quantitatively Analyzing Parameter Adaptation Methods
While a large number of adaptive Differential Evolution (DE) algorithms ...
research
∙
10/02/2020
Reviewing and Benchmarking Parameter Control Methods in Differential Evolution
Many Differential Evolution (DE) algorithms with various parameter contr...
research
∙
10/02/2020
How Far Are We From an Optimal, Adaptive DE?
We consider how an (almost) optimal parameter adaptation process for an ...
research
∙
08/16/2017
A Survey of Parallel A*
A* is a best-first search algorithm for finding optimal-cost paths in gr...
research
∙
06/10/2017
On Hash-Based Work Distribution Methods for Parallel Best-First Search
Parallel best-first search algorithms such as Hash Distributed A* (HDA*)...
research
∙
05/08/2017
Block-Parallel IDA* for GPUs (Extended Manuscript)
We investigate GPU-based parallelization of Iterative-Deepening A* (IDA*...
research
∙
04/29/2017
Classical Planning in Deep Latent Space: Bridging the Subsymbolic-Symbolic Boundary
Current domain-independent, classical planners require symbolic models o...
research
∙
01/16/2012
