A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 by a new approach for computing lower bounds using generalized polygon inequalities, leveraging distance information from two landmarks as opposed to the common single landmark paradigm. In this paper, we demonstrate that this heuristic stores a reduced amount of preprocessing information in comparison to previousarXiv:1603.01607v1 fatcat:izoxkc3ovbajrkdash3vhpln2a