In: LNAI 1952: Advances in Artificial Intelligence, pages 86-pp. International Joint Conference, 7th Ibero-American Conference on AI, 15th Brazilian Symposium on AI, IBERAMIA-SBIA 2000, Atibaia, SP, Brazil, November 2000. Proceedings / Maria Carolina Monard, Jaime Simão Sichman (Eds.) --- Springer Verlag, 2000.
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.
Keywords: AI Planning, Petri Nets, Reachability, Integer Programming..
Back to the Petri Nets Bibliography