Abstract
Recent research shows that Integer Programming techniques are a very promising tool in the AI Planning area. In this paper we define the planning problem as a submarking reachability problem in a Petri net, which is solved by the use of standard IP methods. Using a similar idea to that of the Blackbox algorithm, we show how to translate the plan graph obtained in the first phase of Graphplan into an acyclic Petri net. © Springer-Verlag 2000.
Author supplied keywords
Cite
CITATION STYLE
Silva, F., Alexandre Castilho, M., & Künzle, L. A. (2000). Petriplan: A new algorithm for plan generation (preliminary report). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1952 LNAI, pp. 86–95). Springer Verlag. https://doi.org/10.1007/3-540-44399-1_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
