GPU Accelerated Pathfinding

Bleiweiss, Avi

GPU Accelerated Pathfinding

Files

065-074.pdf (245.29 KB)

Date

2008

Authors

Bleiweiss, Avi

Publisher

The Eurographics Association

Abstract

In the past few years the graphics programmable processor (GPU) has evolved into an increasingly convincing computational resource for non graphics applications. The GPU is especially well suited to address problem sets expressed as data parallel computation with the same program executed on many data elements concurrently. In pursuing a scalable navigation planning approach for many thousands of agents in crowded game scenes, developers became more attracted to decomposable movement algorithms that lend to explicit parallelism. Pathfinding is one key computational intelligence action in games that is typified by intense search over sparse graph data structures. This paper describes an efficient GPU implementation of parallel global pathfinding using the CUDA programming environment, and demonstrates GPU performance scale advantage in executing an inherently irregular and divergent algorithm.

        @inproceedings{:10.2312/EGGH/EGGH08/065-074
,
booktitle = {Graphics Hardware
},
editor = {David Luebke and John Owens
},
title = {{GPU Accelerated Pathfinding
}},
author = {Bleiweiss, Avi
},
year = {2008
},
publisher = {The Eurographics Association
},
ISSN = {1727-3471
},
ISBN = {978-3-905674-09-5
},
DOI = {/10.2312/EGGH/EGGH08/065-074
}
}