Performance Analysis of Real-time Heuristic Search Through Search Space Characterization

  • Author / Creator
    Huntley, Daniel A
  • Recent real-time heuristic search algorithms have demonstrated outstanding performance in video game pathfinding. However, their applications have been thus far limited to that domain. We proceed with the aim of facilitating wider applications of real-time search by fostering a greater understanding of the performance of recent algorithms. We first introduce several algorithm-independent complexity measures for search spaces and correlate their values with algorithm performance. The complexity measures are statistically shown to be strong predictors of algorithm performance across a set of commercial video game maps. We then extend this analysis to a wider variety of search spaces in the first formal application of state of the art real-time search to domains outside of video game pathfinding.

  • Subjects / Keywords
  • Graduation date
  • Type of Item
  • Degree
    Master of Science
  • DOI
  • License
    This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
  • Language
  • Institution
    University of Alberta
  • Degree level
  • Department
    • Department of Computing Science
  • Supervisor / co-supervisor and their department(s)
    • Bulitko, Vadim (Computing Science)
  • Examining committee members and their departments
    • Bowling, Michael (Computing Science)
    • Friedman, Alinda (Psychology)
    • Szafron, Duane (Computing Science)