Adversarial planning for large multi-agent simulations

Authors:
Viliam Lisý
Affiliations:
Czech Technical University, Technická, Prague, Czech Republic
Venue:
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Year:
2010

Citing 5
Cited 0

AI for Game Developers

AI for Game Developers
Adversarial search with procedural knowledge heuristic

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
What Agents Can Probably Enforce

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4

Journal of Artificial Intelligence Research
Verification of Games in the Game Description Language

Journal of Logic and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.