Skip to Main Content
Game AI Pro 2
book

Game AI Pro 2

by Steven Rabin
April 2015
Beginner content levelBeginner
577 pages
17h 58m
English
A K Peters/CRC Press
Content preview from Game AI Pro 2

Chapter 16

Theta* for Any-Angle Pathfinding

Alex Nash and Sven Koenig

16.1 Introduction

One of the central problems in game AI is finding short and realistic-looking paths. Pathfinding is typically divided into two steps: discretize and search. First, the discretize step simplifies a continuous environment into a graph. Second, the search step propagates information along this graph to find a path from a given start vertex to a given goal vertex. Video game developers (and roboticists) have developed several methods for discretizing continuous environments into graphs, such as 2D regular grids composed of squares (square grids), hexagons or triangles, 3D regular grids composed of cubes, visibility graphs, circle-based waypoint graphs, space-filling ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Game AI Pro 3

Game AI Pro 3

Steve Rabin
Game AI Pro

Game AI Pro

Steven Rabin

Publisher Resources

ISBN: 9781482254792