By Topic

Dynamic Programming for Creating Cooperative Behavior of Two Soccer Robots - Part 1: Computation of State-Action Map

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ryuichi Ueda ; Department of Precision Engineering, School of Engineering, The University of Tokyo. ; Kohei Sakamoto ; Kazutaka Takeshita ; Tamio Arai

To solve decision making problems of multi-agent systems, researchers have devised complicated methods, which are expected to solve curse of dimensionality. In this paper, we go to the opposite extreme. We generate cooperative behavior of two soccer robots with a simple dynamic programming (DP), which was proposed in '50s. Through the example, the ability of DP on a recent computer is measured and evaluated both qualitatively and quantitatively. We then show that the simple structure of DP is useful in obtaining behavior of robots in a convincing way. In the implementation of DP, space that is spanned by eight variables for decision making is divided into 610 million states. DP solves the optimal actions of two robots in every division and creates a look-up table, which is called a state-action map. The ability of this state-action map is measured by simulation and the result is discussed.

Published in:

Proceedings 2007 IEEE International Conference on Robotics and Automation

Date of Conference:

10-14 April 2007