Abstract
We propose a potential field approach to represent a game situation. In a potential field, a ball should be moved according to the gradient of the potential field. There are three kinds of potential fields. One is defined for a game field, and another is defined for each robot. The third field is defined as the combination of these two. The combined field is used for evaluation of a situation. We applied this method to our robot control program. Potential values are used to determine the direction in which a robot kicks a ball. We compared the potential field based strategy and an usual “if then” type rule based strategy. The potential field based strategy makes better decisions in several cases and no worse decisions than the rule based strategy.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Jean-Claude Latombe: Robot Motion Planning. Kluwer, (1991)
Yong k. Hwang, Narendra Ahuja: Gross Motion Planning-A Survey. ACM Computing Surveys, Vol.24, No.3, September, (1992) 219–291
Manuela Veloso, et al.: Anticipation: A Key for Collaboration in a Team of Agents. Proc. of Third Int. Conf. on Autonomous Agents, October, (1999)
Tadashi Naruse, et al.: OWARI-BITO Team description. RoboCup-99 Team Description, Accessible from http://www.ida.liu.se/ext/RoboCup-99, (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagasaka, Y., Murakami, K., Naruse, T., Takahashi, T., Mori, Y. (2001). Potential Field Approach to Short Term Action Planning in RoboCup F180 League. In: Stone, P., Balch, T., Kraetzschmar, G. (eds) RoboCup 2000: Robot Soccer World Cup IV. RoboCup 2000. Lecture Notes in Computer Science(), vol 2019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45324-5_37
Download citation
DOI: https://doi.org/10.1007/3-540-45324-5_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42185-6
Online ISBN: 978-3-540-45324-6
eBook Packages: Springer Book Archive