2 papers
cs.DS2016
Computing Shortest Paths Using A*, Landmarks, and Polygon Inequalities (Abstract)
Newton Campbell
We introduce a new heuristic for the A* algorithm that references a data structure much smaller than the one required by the ALT heuristic. This heuristic's benefits are permitted…
cs.DS2016
Using Quadrilaterals to Compute the Shortest Path
Newton Campbell
We introduce a new heuristic for the A* algorithm that references a data structure significantly smaller than that of ALT. We characterize the behavior of this new heuristic based…