AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Combining Bounding Boxes and JPS to Prune Grid Pathfinding

Steve Rabin, Nathan Sturtevant

AAAI 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 22 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add bounding boxes (regular ordering) (ablation)A* · GPPC game mapsavg time (ms): 15.492 -> 1.888Improved
compute bounding boxes with JPS canonical ordering instead of regular (ablation)A*+BB · GPPC game mapsavg time (ms): 1.888 -> 0.524Improved
add bounding boxes (regular ordering) (ablation)JPS+ · GPPC game mapsavg time (ms): 0.072 -> 0.014Improved
compute bounding boxes with canonical ordering instead of regular (ablation)JPS+BB · GPPC game mapsavg time (ms): 0.014 -> 0.010Improved
add bounding boxes (ablation)JPS+ · Random mapsavg time (ms): 213.589 -> 1.363Improved
add bounding boxes (ablation)JPS+ · Room mapsavg time (ms): 0.582 -> 0.038Improved
add bounding boxes (ablation)JPS+ · Dragon Age mapsavg time (ms): 0.048 -> 0.008Improved
JPS+BB vs SRC all-pairs compressed databaseJPS+BB · GPPC all problemstotal time (s): 259.9 vs 251.7Mixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy