Rapidly-Exploring Random Tree approach for Geometry Friends

Authors

  • Rui Soares
  • Francisco Leal
  • Rui Prada
  • Francisco Melo

Keywords:

geometry friends, rapidly-exploring random tree, pid control, planning

Abstract

Geometry Friends (GF) is a physics-based platform game, where players control one of two characters (a circle and a rectangle) through a series of both individual and cooperative levels. Each level is solved by retrieving a set of collectibles. This paper proposes an approach using Rapidly-exploring Random Trees (RRTs) to find a solution for the individual levels of Geometry Friends. Solving a level of GF is divided into two subtasks: (1) planning the level; and (2) executing in real time the sequence of moves required to fulfill the plan. We use our RRT approach to solve (1) and a Proportional Integral Derivative (PID) controller to guide (2). The quality of the agent implemented was measured in the 2015 GF Game AI Competition. Results show that our agents are able to plan both public and private levels and are able to control their motion in order to finish most of them.

Downloads

Published

2016-01-01

Bibtex

@Conference{digra782, title ="Rapidly-Exploring Random Tree approach for Geometry Friends", year = "2016", author = "Soares, Rui and Leal, Francisco and Prada, Rui and Melo, Francisco", publisher = "DiGRA", address = "Tampere", howpublished = "\url{https://dl.digra.org/index.php/dl/article/view/782}", booktitle = "Proceedings of DiGRA/FDG 2016 Conference"}