Solving Belief-Driven Pathfinding using Monte-Carlo Tree Search

Authors

  • Davide Aversa
  • Stavros Vassos

Keywords:

pathfinding, artificial intelligence, beliefs, monte carlo ts

Abstract

In this work we discuss a stochastic extension to the (discrete) Belief-Driven Pathfinding (BDP) approach for finding personalized paths based on the beliefs of a character about the current state of the map. Our stochastic BDP upgrades previous work to the more realistic setting of using probabilities for the beliefs and takes advantage of approximate Monte Carlo Tree Search approaches.

Downloads

Published

2016-01-01

Bibtex

@Conference{digra898, title ="Solving Belief-Driven Pathfinding using Monte-Carlo Tree Search", year = "2016", author = "Aversa, Davide and Vassos, Stavros", publisher = "DiGRA", address = "Tampere", howpublished = "\url{https://dl.digra.org/index.php/dl/article/view/898}", booktitle = "Abstract Proceedings of DiGRA/FDG 2016 Conference"}

Proceedings

2016: Abstract Proceedings of DiGRA/FDG 2016 Conference

Section

Papers

License

© Authors & Digital Games Research Association DiGRA. Personal and educational classroom use of this paper is
allowed, commercial use requires specific permission from the author.