Abstract
In the single-agent case general game playing and action planning are two related topics, so that one might hope to use the established planners to improve the handling of general single-player games. However, both come with their own description language, GDL and PDDL, respectively. In this paper we propose a way to translate single-player games described in GDL to PDDL planning tasks and provide an evaluation on a wide range of single-player games, comparing the efficiency of grounding and solving the games in the translated and in the original format.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Björnsson, Y., Finnsson, H.: Cadiaplayer: A simulation-based general game player. IEEE Transactions on Computational Intelligence and AI in Games 1(1), 4–15 (2009)
Edelkamp, S., Hoffmann, J.: PDDL2.2: The language for the classical part of the 4th international planning competition. Tech. Rep. 195, Albert-Ludwigs-Universität, Institut für Informatik, Freiburg, Germany (2004)
Genesereth, M.R., Love, N., Pell, B.: General game playing: Overview of the AAAI competition. AI Magazine 26(2), 62–72 (2005)
Haufe, S., Schiffel, S., Thielscher, M.: Automated verification of state sequence invariants in general game playing. Artificial Intelligence 187, 1–30 (2012)
Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research 26, 191–246 (2006)
Hoffmann, J.: FF: The fast-forward planning system. The AI Magazine 22(3), 57–62 (2001)
Kissmann, P., Edelkamp, S.: Gamer, a general game playing agent. KI 25(1), 49–52 (2011)
Kocsis, L., Szepesvári, C.: Bandit based Monte-Carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006)
Love, N.C., Hinrichs, T.L., Genesereth, M.R.: General game playing: Game description language specification. Tech. Rep. LG-2006-01, Stanford Logic Group (2008)
McDermott, D., et al.: The PDDL Planning Domain Definition Language. The AIPS 1998 Planning Competition Comitee (1998)
Méhat, J., Cazenave, T.: A parallel general game player. KI 25(1), 43–47 (2011)
Rauber, T.: Translating Single-Player GDL into PDDL. Bachelor’s thesis, Department of Computer Science, Faculty of Natural Sciences and Technology I, Saarland University (2013)
Richter, S., Westphal, M.: The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research 39, 127–177 (2010)
Rüdiger, C.: Use of existing planners to solve single-player games. Großer Beleg, Fakultät Informatik, Technische Universität Dresden (2009)
Sievers, S.: Erweiterung eines Planungssystems zum Lösen von Ein-Personen-Spielen. Bachelor’s thesis, Arbeitsgruppe Grundlagen der künstlichen Intelligenz, Institut für Informatik, Albert-Ludwigs Universität Freiburg (2009)
Thiebaux, S., Hoffmann, J., Nebel, B.: In defense of PDDL axioms. Artificial Intelligence 168(1-2), 38–69 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rauber, T., Kissmann, P., Hoffmann, J. (2013). Translating Single-Player GDL into PDDL. In: Timm, I.J., Thimm, M. (eds) KI 2013: Advances in Artificial Intelligence. KI 2013. Lecture Notes in Computer Science(), vol 8077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40942-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-40942-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40941-7
Online ISBN: 978-3-642-40942-4
eBook Packages: Computer ScienceComputer Science (R0)