Abstract
This article presents an overview of the Essex Wizards 2001 team participated in the RoboCup 2001 simulator league. Four major issues have been addressed, namely a generalized approach to position selection, strategic planning and encoded communication, reinforcement learning (RL) and Kanerva-based generalization, as well as the agent architecture and agent behaviours.
Chapter PDF
Similar content being viewed by others
References
M. Hunter and H. Hu, A Generalised Approach to Position Selection for Simulated Soccer Agents, Proc. of the RoboCup 2001 International Symposium, Seattle, Washington, 4–10 August 2001
N. Kalyviotis and H. Hu, A Co-operative Framework for Strategic Planning, Proceedings Towards Intelligent Mobile Robots (TIMR)’ 01, Manchester, 2001.
N. Kalyviotis and H. Hu, ASPF: an Adaptive Strategic Planning Framework in RoboCup, Proc. of IASTED International Conference on Robotics and Applications, Clearwater, Florida, USA, 19–22 November 2001.
K. Kostiadis, M. Hunter and H. Hu, The Use of Design Patterns for Building Multi-Agent Systems, IEEE Int. Conf. on Systems, Man and Cybernetics, Nashville, Tennessee, USA, 8–11 October 2000
K. Kostiadis and H. Hu, K-RL: Kanerva-based Generalisation and Reinforcement Learning for Possession Football, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, Hawaii, USA, November 2001
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, H., Kostiadis, K., Hunter, M., Kalyviotis, N. (2002). Essex Wizards 2001 Team Description. In: Birk, A., Coradeschi, S., Tadokoro, S. (eds) RoboCup 2001: Robot Soccer World Cup V. RoboCup 2001. Lecture Notes in Computer Science(), vol 2377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45603-1_71
Download citation
DOI: https://doi.org/10.1007/3-540-45603-1_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43912-7
Online ISBN: 978-3-540-45603-2
eBook Packages: Springer Book Archive