This article was published for PREMIUM members, available by subscription. You can join here in a minute or less. If you're already a member, log-in from the top right menu.

Premium Teaser

Beyond A*: Speeding Up Pathfinding Through Hierarchical Abstraction

Daniel Harabor on March 19, 2009

What's the next step for pathfinding after the traditional A* algorithm? Find out how to improve the performance of search using a hierarchical representation combined with pathfinding on multiple layers — known as the HPA* algorithm. This masterclass will also show you how to deal with many different unit sizes and capabilities, while at the same time preserving the same speed-up provided by the hierarchy. Finally, you'll see different ways to break away from the 2D grid and instead support continuous space, using a technique known as probabilistic roadmaps.