Abstract
This paper describes the scoring policy which is used by the agents of the UvA Trilearn simulation team. In a given situation this policy enables an agent to determine the best shooting point in the goal, together with an associated probability of scoring when the ball is shot to this point. Our policy is based on an approximate method for learning the relevant statistics of the ball motion which can be regarded as a geometrically constrained continuous-time Markov process.
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
Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 1. John Wiley & Sons, Inc., New York (1957)
Foroughi, E., Heintz, F., Kapetanakis, S., Kostiadis, K., Kummeneje, J., Noda, I., Obst, O., Riley, P., Steffens, T.: RoboCup Soccer Server User Manual: for Soccer Server version 7.06 and later (2001), At http://sourceforge.net/projects/sserver
Ripley, B.D.: Pattern Recognition and Neural Networks. Cambridge University Press, Cambridge, U.K (1996)
Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs (1995)
Stone, P., Riley, P., Veloso, M.: Denning and Using Ideal Teammate and Opponent Agent Models. In: Twelfth Innovative Applications of AI Conference, IAAI 2000 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kok, J., de Boer, R., Vlassis, N., Groen, F.C.A. (2003). Towards an Optimal Scoring Policy for Simulated Soccer Agents. In: Kaminka, G.A., Lima, P.U., Rojas, R. (eds) RoboCup 2002: Robot Soccer World Cup VI. RoboCup 2002. Lecture Notes in Computer Science(), vol 2752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45135-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-45135-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40666-2
Online ISBN: 978-3-540-45135-8
eBook Packages: Springer Book Archive