Abstract
Recently many papers have been published on how to improve the A* planning algorithm. A number of these papers are from ex-computer-chess practitioners. This paper attempts to summarize some of the enhancements to A*, and shows why a “computer chess”-style A* approach may be considered to be profitable when implementing A*.
Get full access to this article
View all access options for this article.
