Algoritmos para Planificação Baseada em STRIPS

Fabiano Silva

Dissertação de mestrado defendida em 19 de outubro de 2000 perante a seguinte banca:

Prof. Dr. Marcos Alexandre Castilho (orientador)
Profa. Dra. Sandra Sandri - IME/USP
Prof. Dr. Michel Gagnon - DInf/UFPR

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.

PostScript

Bibtex-entry:


@MastersThesis{FabianoSilva-th,
  title = {Algoritmos para Planificação baseados em Strips},
  author = {Fabiano Silva},
  school = {Universidade Federal do Paraná},
  address = {Curitiba PR Brasil},
  orientador = {Marcos Alexandre Castilho},
  month = {outubro},
  year = {2000}
}

http://www.inf.ufpr.br/~marcos