Explaining Synthesized Pathfinding Heuristics via Iterative Visualization and Modification

  • Shuwei Wang
  • , Vadim Bulitko
  • , William Yeoh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Heuristic search is widely used for game pathfinding with heuristic functions substantially influencing its pathfinding performance. Recent work used program synthesis to automatically generate high-performance formula-based heuristics. Their compactness and human readability offered a promise of explainability. In this paper we present an automated approach to decompose and visualize formula-based heuristics. To illustrate the explanatory power of the visualization we include it in a human-in-the-loop process to iteratively modify heuristic formulae and improve their search performance. The iterative process is meant to encourage human experimentation with the formula-based heuristics thereby increasing the understanding and trust of a game-AI developer or a heuristic search researcher.

Original languageEnglish
Title of host publicationProceedings of the 2024 IEEE Conference on Games, CoG 2024
PublisherIEEE Computer Society
ISBN (Electronic)9798350350678
DOIs
StatePublished - 2024
Event6th Annual IEEE Conference on Games, CoG 2024 - Milan, Italy
Duration: Aug 5 2024Aug 8 2024

Publication series

NameIEEE Conference on Computatonal Intelligence and Games, CIG
ISSN (Print)2325-4270
ISSN (Electronic)2325-4289

Conference

Conference6th Annual IEEE Conference on Games, CoG 2024
Country/TerritoryItaly
CityMilan
Period08/5/2408/8/24

Keywords

  • heuristic search
  • program synthesis
  • search visualization

Fingerprint

Dive into the research topics of 'Explaining Synthesized Pathfinding Heuristics via Iterative Visualization and Modification'. Together they form a unique fingerprint.

Cite this