Algoritmo para Planificação Baseada em STRIPS

Abstract

This work presents a new approach to the artificial intelligence planning problem based on STRIPS representation, known to be PSPACE-Complete. We describe some recent algorithms to the planning problem related to this work, and compare some of these to our algorithm, the Petriplan. Our approach define the planning problem as a sub-marking reachability problem in a Petri net, which is solved by the use of standard integer programming methods. The solution to planning problem is then obtained by the solution of the IP problem.