DTheses  
Athabasca University

Digital Thesis Room >
Faculty of Graduate Studies >
Theses prior to 2011 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10791/81

Title: Pathfinding Strategy for Multiple Non-Playing Characters and Agents in a 2.5D Game World
Authors: Macgregor, J. John
Supervisor(s): Yeung, Steve
Degree: Master of Science, Information Systems (MScIS)
Department: Faculty of Science and Technology
Keywords: pathfinding
AI
dijkstra
BFS
A*
agents
NPC
isometric
game world
Issue Date: 2009
Abstract: This essay focuses on pathfinding in a 2.5D game world for Non-playing Characters (NPC) and agents. The primary focus is to investigate and determine the optimal pathfinding strategy based on several measures such as steps and time taken to reach the goal. For this investigation the most popular pathfinding algorithms and interaction schemes will be analyzed and tested using standard analysis techniques and test applications. The result of this analysis and testing is that it is shown that the A* algorithm is optimal using the Manhattan distance heuristic. Unfortunately, our testing did not reveal an optimal choice among the three interaction scheme that was tested which were cooperative, non-cooperative and competitive.
Graduation Date: Feb-2009
URI: http://hdl.handle.net/10791/81
Appears in Collections:Theses prior to 2011

Files in This Item:

File Description SizeFormat
jasonmacgregorEssay.pdf2.91 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Athabasca University Library
Athabasca University Library
Hours: Monday-Friday 8:30am-4:30pm (MT)
Phone: 1-800-788-9041
Fax: 780-675-6477
E-mail: library@athabascau.ca