Abstract
In this work, we explore two Monte-Carlo planning approaches: Upper Confidence Tree (UCT) and Rapidly exploring Random Tree (RRT). These Monte-Carlo planning approaches are applied in a real-time strategy game for solving the path finding problem. The planners are evaluated using a grid-based representation of our game world. The results show that the UCT planner solves the path planning problem with significantly less search effort than the RRT planner. The game playing performance of each planner is evaluated using the mean, maximum and minimum scores in the test games. With respect to the mean scores, the RRT planner shows better performance than the UCT planner. The RRT planner achieves more maximum
scores than the UCT planner in the test games.
scores than the UCT planner in the test games.
Original language | English |
---|---|
Title of host publication | Proceedings of the 28th Workshop of the UK Special Interest Group on Planning and Scheduling |
Subtitle of host publication | joint meeting with the 4th Italian Workshop on Planning and Scheduling: PlanSIG2010 |
Editors | Simone Fratini, Alfonso Gerevini, Derek Long, Alessandro Saetti |
Publisher | Consiglio Nazionale delle Ricerche |
Pages | 125-139 |
Number of pages | 15 |
Publication status | Published - 1 Dec 2010 |
Event | 28th Workshop of the UK Special InterestGroup on Planning and Scheduling : joint meeting with the 4th Italian Workshop on Planning and Scheduling - Brescia, Italy Duration: 1 Dec 2010 → 2 Dec 2010 Conference number: 28 |
Publication series
Name | Proceedings of the Workshop of the UK Special Interest Group on Planning and Scheduling |
---|---|
Publisher | Consiglio Nazionale delle Ricerche |
ISSN (Print) | 1368-5708 |
Workshop
Workshop | 28th Workshop of the UK Special InterestGroup on Planning and Scheduling |
---|---|
Abbreviated title | PlanSIG2010 |
Country/Territory | Italy |
City | Brescia |
Period | 1/12/10 → 2/12/10 |