Título: Algoritmo para Planificação Baseada em STRIPS
Autores: Silva, Fabiano
Fecha: 2004-06-21
2004-10-04
2004-06-21
2004-10-04
2000
Publicador: Universidade Federal do Parana
Fuente:
Tipo: Other
Tema: planificacao em inteligencia artificial
alcançabilidade
sub-marcacao
Descripción: 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.
Master thesis, Dinf, UFPR.
Idioma: Otro

Artículos similares:

Introdução à Geometria Computacional por Guedes, Andre Luiz Pires
10 
Projeto Paraná Digital por Direne, Alexandre I.,Guedes, Andre Luiz Pires,Carvalho,Carlos,Weingaertner, Daniel,Silva, Fabiano,Silva, Luciano,Bona, Luis C. E.,Sunye, Marcos S.,Castilho, Marcos A.