GDC is part of the Informa Tech Division of Informa PLC

This site is operated by a business or businesses owned by Informa PLC and all copyright resides with them. Informa PLC's registered office is 5 Howick Place, London SW1P 1WG. Registered in England and Wales. Number 8860726.

GDC + VRDC 2019 Session Scheduler

View, browse and sort the ever-growing list of GDC sessions by pass type, track, format, and more! With Session Scheduler, create an account to build your own GDC schedule and access it anywhere, including on the GDC app, once live.

If you've registered for GDC, you can use the same login credentials. Adding a session to your schedule does not guarantee you a seat. Sessions do fill up, so please arrive early to sessions that you would like to attend.

New Ideas for Any-Angle Pathfinding

Daniel Harabor  (Senior Research Fellow, Monash University)

Location: Room 2002, West Hall

Date: Monday, March 18

Time: 3:00 pm - 3:30 pm

Pass Type: All Access, GDC Conference + Summits, GDC Summits - Get your pass now!

Topic: AI Summit

Format: Session

Vault Recording: Video

Audience Level: Advanced

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.


Attendees will learn about new and highly efficient algorithms for computing shortest paths on a navigation mesh or grid.

Intended Audience

The intended audience is practicing AI programmers. The talk will assume familiarity with basic data structures and algorithms. The talk will also assume familiarity with grids, navigation meshes, and the A* algorithm.