You've been logged out of GDC Vault since the maximum users allowed for this account has been reached. To access Members Only content on GDC Vault, please log out of GDC Vault from the computer which last accessed this account.

Click here to find out about GDC Vault Membership options for more users.


The Number One Educational Resource for the Game Industry

Session Name: New Ideas for Any-Angle Pathfinding
Speaker(s): Daniel Harabor
Company Name(s): Monash University
Track / Format: AI Summit

Did you know free users get access to 30% of content from the last 2 years?

Get your team full access to the most up to date GDC content

Overview: 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.

GDC 2019

Daniel Harabor

Monash University

free content

AI Summit