论文信息 - Petriplan: A New Algorithm for Plan Generation (Preliminary Report)

Petriplan: A New Algorithm for Plan Generation (Preliminary Report)

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.

Marcos A. Castilho | Fabiano Silva | Luis Allan Künzle

[1] Daniel S. Weld. Recent Advances in AI Planning , 1999, AI Mag..

[2] Alexander Bockmayr,et al. Mixed Integer Programming Models for Planning Problems , 1998 .

[3] Henry A. Kautz,et al. State-space Planning by Integer Optimization , 1999, AAAI/IAAI.

[4] Peter van Beek,et al. CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.

[5] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[6] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[7] Dana S. Nau,et al. On the Use of Integer Programming Models in AI Planning , 1999, IJCAI.

[8] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[9] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[10] Jaegeol Yim,et al. A Predicate-Transition Net Model for Multiple Agent Planning , 1991, Inf. Sci..

[11] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[12] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.