Solving motion and action planning for a cooperative agent problem using geometry friends

1Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we discuss the development of agents for the Geometry Friends game, which poses simultaneously problems of planning and motion control in an physics-based puzzle and platform 2D world. The game is used in a competition, held yearly, that challenges participants to solve single player and cooperative levels. Our work addresses the two. The approach followed uses Rapidly-Exploring Random Trees with strategies to accelerate the search. When comparing with other agents on the competition, our results show that our agents can solve the single player challenges without overspecialization and are also promising for the cooperative levels with either agent-agent and human-agent players.

Cite

CITATION STYLE

APA

Salta, A., Prada, R., & Melo, F. (2019). Solving motion and action planning for a cooperative agent problem using geometry friends. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11804 LNAI, pp. 86–97). Springer Verlag. https://doi.org/10.1007/978-3-030-30241-2_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free