A heuristic pathfinding approach based on precomputing and post-adjusting strategies for online game environment

Author

Tang, Jia-jia ; Chen, Liang ; Yan, Ling

Author_Institution

Comput. Sci. Dept., Univ. of Northern British Columbia, Prince George, BC, Canada

fYear

2010

fDate

21-23 Dec. 2010

Firstpage

1

Lastpage

8

Abstract

Pathfinding approaches that work for console games fail to meet the challenges of online games due to the distinct requirements of online games. This paper proposes an implementable heuristic approach for online game pathfinding so as to increase the efficiency and overall performance of the game systems. With a distributed structure, the heuristic approach first pre-computes paths among non-overlapped polygons, stores them in a data management system, and then provides upon online request the paths between any points in the map by employing a dynamic reference point adjustment strategy.

Keywords

computer games; console game system; data management system; dynamic reference point adjustment strategy; heuristic pathfinding; online game environment; online game pathfinding; online request; post-adjusting strategy; precomputing strategy; Algorithm design and analysis; Artificial intelligence; Games; Heuristic algorithms; Navigation; Runtime; Servers; Pathfinding; pathfinding for online game; pathfinding with database; precomputed paths; territory based;

fLanguage

English

Publisher

ieee

Conference_Titel

Games Innovations Conference (ICE-GIC), 2010 International IEEE Consumer Electronics Society's

Conference_Location

Hong Kong

Print_ISBN

978-1-4244-7178-2

Electronic_ISBN

978-1-4244-7179-9

Type

conf

DOI

10.1109/ICEGIC.2010.5716878

Filename

5716878