Multi-agent task division learning in hide-and-seek games

Authors:
Mohamed K. Gunady;Walid Gomaa;Ikuo Takeuchi
Affiliations:
Egypt-Japan University of Science and Technology, New Borg El-Arab, Alexandria, Egypt;Egypt-Japan University of Science and Technology, New Borg El-Arab, Alexandria, Egypt;Egypt-Japan University of Science and Technology, New Borg El-Arab, Alexandria, Egypt,Faculty of Science and Engineering, Waseda University, Tokyo, Japan
Venue:
AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
Year:
2012

Citing 8
Cited 0

Technical Note: \cal Q-Learning

Machine Learning
Transfer of Learning by Composing Solutions of Elemental Sequential Tasks

Machine Learning
Convergence Results for Single-Step On-PolicyReinforcement-Learning Algorithms

Machine Learning
Machine Learning

Machine Learning
Introduction to Reinforcement Learning

Introduction to Reinforcement Learning
Coverage for robotics – A survey of recent results

Annals of Mathematics and Artificial Intelligence
Learning to Predict by the Methods of Temporal Differences

Machine Learning
Reinforcement learning: a survey

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the problem of territory division in Hide-and-Seek games. To obtain an efficient seeking performance for multiple seekers, the seekers should agree on searching their own territories and learn to visit good hiding places first so that the expected time to find the hider is minimized. We propose a learning model using Reinforcement Learning in a hierarchical learning structure. Elemental tasks of planning the path to each hiding place are learnt in the lower layer, and then the composite task of finding the optimal sequence is learnt in the higher layer. The proposed approach is examined on a set of different maps and resulted in convergece to the optimal solution.