@inproceedings{5344620276e341719deeff3b67fbe7fb,
title = "A planning graph heuristic for forward-chaining adversarial planning",
abstract = "In contrast to classical planning, in adversarial planning, the planning agent has to face an adversary trying to prevent him from reaching his goals. In this paper, we investigate a forward-chaining approach to adversarial planning based on the AO* algorithm. The exploration of the underlying AND/OR graph is guided by a heuristic evaluation function, inspired by the relaxed planning graph heuristic used in the FF planner. Unlike FF, our heuristic uses an adversarial planning graph with distinct proposition and action layers for the protagonist and antagonist. First results suggest that in certain planning domains, our approach yields results competitive with the state of the art.",
author = "Pascal Bercher and Robert Mattm{\"u}ller",
note = "Publisher Copyright: {\textcopyright} 2008 The authors and IOS Press. All rights reserved.; 18th European Conference on Artificial Intelligence, ECAI 2008 ; Conference date: 21-07-2008 Through 25-07-2008",
year = "2008",
month = jun,
doi = "10.3233/978-1-58603-891-5-921",
language = "English",
isbn = "978-1-58603-891-5",
volume = "178",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press BV",
pages = "921--922",
editor = "Malik Ghallab and Spyropoulos, \{Constantine D.\} and Nikos Fakotakis and Nikos Avouris",
booktitle = "18th European Conference on Artificial Intelligence",
address = "Netherlands",
}