Adversarial planning for large multi-agent simulations

We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order to find high quality plans with reduced amount of computations. We further suggest finding a formal framework for describing these properties and complementing our previous mostly experimental results by formal guarantees. Categories and Subject Descriptors I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods, and Search--Heuristic methods Keywords Multi-player Game, Adversarial Search, Heuristic

• Type: Conference
• Year: 2010
• Where: ATAL
• Authors: Viliam Lisý
• Keywords: ATAL 2010, Heuristic Algorithms, Intelligent Agents, Keywords Multi-player Game, Large Multi-agent Simulations