UBM Tech - Game Network

My Shopping Cart

[ 1 ] items in cart

View Cart | Checkout

Game Developer Research

Research Reports

Gamasutra

Contractor Listings

GDC Vault

Individual Subscription

GDC Audio Recordings

App Developers Conference 2013

GDC Next 2013

GDC Europe 2013

	GDC 2013
	GDC Online 2012
	GDC Europe 2012
	GDC 2012
	GDC 2011
	GDC 10
	GDC 09
	GDC Austin 08
	GDC Mobile 08
	GDC 08
	GDC Austin 07
	GDC Mobile 07
	GDC 07
	GDC 06
	GDC 05
	GDC 04
	GDC 03
	GDC 01
	GDC 2000 & Before

Newest Item(s)

Why Now Is the Best Time Ever to Be a Game Developer

Ingress: Design Principles Behind Google's Massively Multiplayer Geo Game

Playing with 'Game'

Gathering Your Party with Project Eternity (GDC Next 10)

D4: Dawn of the Dreaming Director's Drama (GDC Next 10)

Using Plot Devices to Create Gameplay in Storyteller (GDC Next 10)

How I Learned to Stop Worrying and Love Making CounterSpy (GDC Next 10)

Luck and Skill in Games

Minimalist Game Design for Mobile Devices

Broken Age: Rethinking a Classic Genre for the Modern Era (GDC Next 10)

Storefront > GDC Vault Store - Audio Recordings > GDC 2006

View larger image

QTY:

Crowds In A Polygon Soup: Next-Gen Path Planning
Price	$5.95
Adjustment
Type
Stock	Unlimited
Status
Weight	0 lb, 0 oz
SKU	GDC-06-038
Statistics

Description

Crowds In A Polygon Soup: Next-Gen Path Planning,
1559

Programming, Lecture

David Miles
Senior Programmer, BabelFlux LLC
This session deals with efficient path finding, flocking, and squad movement behaviors in a complex and dynamically changing world. A graph of connected convex volumes, accurately encapsulating the usable free-space of the game world, is quickly computed from an arbitrary polygon soup of level mesh, using a straightforward 3D rasterization and volume extraction technique. Because the planning graph encapsulates the usable free-space, it supports not only path finding queries, but also repulsion field based flocking and squad behaviors, relying only on rapid checks within the planning graph, avoiding ray-casts against the collision geometry. The planning graph, while detailed enough to support these advanced motion behaviors, is simple enough that it can be updated at runtime as dynamic obstacles modify the environment.

To support advanced motion planning capabilities, a graph of connected convex volumes accurately encapsulating the usable free-space of the game world can be quickly computed from an arbitrary polygon soup of level mesh using a straightforward 3D rasterization and volume extraction technique. Because the planning graph encapsulates the usable free-space, it supports not only path finding queries, but also repulsion field based flocking and squad behaviors, relying only on rapid checks within the planning graph, avoiding ray-casts against the collision geometry. The planning graph, while detailed enough to support these advanced motion behaviors, is simple enough that it can be updated at runtime as dynamic obstacles modify the environment.

This presentation is suitable for programmers with a basic understanding of path planning and 3D math. Some familiarity with computation geometry could be beneficial, but is not necessary.

Please leave this field blank.