The grid-based path planning competition: 2014 entries and results
Abstract The Grid-Based Path Planning Competition has just completed its third iteration.
The entriesused in the competition have improved significantly during this time, changing …
The entriesused in the competition have improved significantly during this time, changing …
Compressing optimal paths with run length encoding
B Strasser, A Botea, D Harabor - Journal of Artificial Intelligence Research, 2015 - jair.org
We introduce a novel approach to Compressed Path Databases, space efficient oracles
used to very quickly identify the first edge on a shortest path. Our algorithm achieves query …
used to very quickly identify the first edge on a shortest path. Our algorithm achieves query …
Compressed path databases with ordered wildcard substitutions
M Salvetti, A Botea, A Saetti, AE Gerevini - Proceedings of the …, 2017 - ojs.aaai.org
Compressed path databases (CPDs) are a state-of-the-art approach to path planning, a core
AI problem. In the Grid-based Path Planning Competition, the CPD-based SRC path …
AI problem. In the Grid-based Path Planning Competition, the CPD-based SRC path …
[PDF][PDF] Improving Pruning and Compression Techniques in Path Planning
S Zhao - 2022 - scholar.archive.org
Path planning is a well-studied problem in AI. In many scenarios, such as computer games
and trip planning, the environments are two dimensional Euclidean planes with obstacles. In …
and trip planning, the environments are two dimensional Euclidean planes with obstacles. In …