Abstract
In this paper the classical planning problem is formalized as a Petri Net. We review the Graphplan notions of mutex relation and maintenance actions based on the Petri Net flow. We classify pairs of conflicting actions in terms of four different control structures, which are used to build the Planning Net. The planning problem represented by the net is translated into a SAT instance and then solved using a modern SAT solver. We show the advantages of our method comparing our new planner with Satplan in classical planning domains.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, A., Furst, M.: Fast Planning through Planning Graph Analysis. In: 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 1636–1642 (1995)
International Planning Competition - ICAPS, http://ipc.icaps-conference.org/
Kautz, H.A., Selman, B.: Pushing the Envelope – Planning, Propositional Logic, and Stochastic Search. In: Shrobe, H., Senator, T. (eds.) 13th National Conference on Artificial Intelligence (AAAI 1996) and 8th Innovative Applications of Artificial Intelligence Conference (IAAI 1996), pp. 1194–1201. AAAI (1996)
Kautz, H.A.: Deconstructing Planning as Satisfiability. In: 21st National Conference on Artificial Intelligence (AAAI 2006) and 18th Innovative Applications of Artificial Intelligence Conference (IAAI 2006), pp. 1524–1526. AAAI (2006)
VAL, The Automatic Validation Tool For PDDL, including PDDL3 and PDDL+ Strathclyde Planning Group, http://planning.cis.strath.ac.uk/VAL/
The international SAT Competitions web page, http://www.satcompetition.org
Silva, F., Castilho, M.A., Künzle, L.A.: Petriplan: A New Algorithm for Plan Generation (Preliminary Report). In: Monard, M.C., Sichman, J.M. (eds.) SBIA 2000 and IBERAMIA 2000. LNCS (LNAI), vol. 1952, pp. 86–95. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schreiner, M.A., Castilho, M.A., Silva, F., Kunzle, L.A. (2012). The Planning Net: Exploring the Petri Net Flow to Improve Planning Solvers. In: Pavón, J., Duque-Méndez, N.D., Fuentes-Fernández, R. (eds) Advances in Artificial Intelligence – IBERAMIA 2012. IBERAMIA 2012. Lecture Notes in Computer Science(), vol 7637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34654-5_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-34654-5_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34653-8
Online ISBN: 978-3-642-34654-5
eBook Packages: Computer ScienceComputer Science (R0)