Solving multi-agent decision problems modeled as Dec-POMDP: A robot soccer case study

5Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Robot soccer is one of the major domains for studying the coordination of multi-robot teams. Decentralized Partially Observable Markov Decision Process (Dec-POMDP) is a recent mathematical framework which has been used to model multi-agent coordination. In this work, we model simple robot soccer as Dec-POMDP and solve it using an algorithm which is based on the approach detailed in [1]. This algorithm uses finite state controllers to represent policies and searches the policy space with genetic algorithms. We use the TeamBots simulation environment. We use score difference of a game as a fitness and try to estimate it by running many simulations. We show that it is possible to model a robot soccer game as a Dec-POMDP and achieve satisfactory results. The trained policy wins almost all of the games against the standard TeamBots teams, and a reinforcement learning based team developed elsewhere. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Aşik, O., & Akin, H. L. (2013). Solving multi-agent decision problems modeled as Dec-POMDP: A robot soccer case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7500 LNAI, pp. 130–140). https://doi.org/10.1007/978-3-642-39250-4_13

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