Home › Per Daniel Harabor (2011 AAAI paper), JPS (Jump …
Per Daniel Harabor (2011 AAAI paper), JPS (Jump Point Search) accelerates A* on UNIFORM-COST grids by which trick?
ASwitch to Dijkstra when goal is far from start
BSkip 'forced' chain of neighbours along straight runs
CUse a precomputed lookup table for every grid pair
DReplace heuristic h with constant zero everywhere
Answer & Solution
Correct answer: B. Skip 'forced' chain of neighbours along straight runs
Harabor + Grastien 2011 'Online Graph Pruning for Pathfinding on Grid Maps': on uniform grids, intermediate equivalent paths can be skipped (jump points). Massive speedup.
Related questions
In Reynolds-style steering behaviours combined into a STEERING PIPELINE, the OUTPUT accelePer Dave Mark + Brian Schwab, a RESPONSE CURVE in utility AI maps an input variable to a sIn modern game AI, REINFORCEMENT LEARNING agents (e.g. OpenAI Five, DeepMind AlphaStar) lePer AlphaGo (Silver et al. 2016, Nature), MONTE CARLO TREE SEARCH (MCTS) explores a game tPer Daniel Harabor's follow-up work and the public literature, JPS+ (the offline variant) In tactical AI, an INFLUENCE MAP is best described as which data structure?In behaviour trees beyond sequence + selector, a DECORATOR node typically does which?Per Dave Mark ('Behavioral Mathematics for Game AI'), UTILITY AI selects actions by which