|New Ideas for Any-Angle Pathfinding
|Track / Format:
Did you know free users get access to 30% of content from the last 2 years?
|To compute paths for virtual characters we often transform a continuous environment into a simplified grid or a navigation mesh. However, pathfinding algorithms developed for grids and meshes usually return only approximate shortest paths, with unnecessary detours and additional turns being common side-effects. In this session, the speaker will discuss a range of "any-angle" techniques that can help you overcome such difficulties. The presentation will also describe Anya and Polyanya, two new algorithms which not only guarantee to compute actual shortest paths but which can also run 10-100+ times faster than traditional grid-based A* search.