Proceedings

Heuristic Selection of Actions in Multiagent Reinforcement Learning

Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, Anna Helena Reali Costa

Download BibTeX Cite

Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 690-694.

Abstract

This work presents a new algorithm, called Heuristically Accelerated Minimax-Q (HAMMQ), that allows the use of heuristics to speed up the well-known Multiagent Reinforcement Learning algorithm Minimax-Q. A heuristic function that influences the choice of the actions characterises the HAMMQ algorithm. This function is associated with a preference policy that indicates that a certain action must be taken instead of another. A set of empirical evaluations were conducted for the proposed algorithm in a simplified simulator for the robot soccer domain, and experimental results show that even very simple heuristics enhances significantly the performance of the multiagent reinforcement learning algorithm.

Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, and Anna Helena Reali Costa. 2007. Heuristic Selection of Actions in Multiagent Reinforcement Learning. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07. IJCAI, 690–694. https://ijcai.org/proceedings/2007/110
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards