Partial Synthesis of Heuristic Search Algorithms

• Author / Creator

  Gallivan, Matthew

• Heuristic search is a core area of Artificial Intelligence (AI) with numerous applications. In video games it is commonly used to calculate paths of AI-controlled agents. Traditionally, heuristic search algorithms have been designed by humans. Recent work attempted to synthesise heuristic search algorithms by automatically combining elements of published algorithms. In doing so, researchers defined a synthesis space for heuristic search algorithms and then automatically searched through that space. We extend this line of work and make the following contributions. First, we define a richer space of algorithms using a finer set of building blocks. This space is constructed using a context-free grammar. We then show that in the new space we can automatically synthesise higher performing real-time heuristic search algorithms. We evaluate these algorithms over benchmark pathfinding problems taken from video games and show that our synthesis method outperforms existing work.

• Subjects / Keywords

  • Video Games
  • Real-time Heuristic Search
  • Pathfinding
  • Program Synthesis

• Graduation date

  Fall 2021

• Type of Item

  Thesis

• Degree

  Master of Science

• DOI

  https://doi.org/10.7939/r3-dn7e-jj06

• 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.