Algoritmo para Planificação Baseada em STRIPS

DSpace/Manakin Repository

Algoritmo para Planificação Baseada em STRIPS

Show full item record


Title: Algoritmo para Planificação Baseada em STRIPS
Author: Silva, Fabiano
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.
Description: Master thesis, Dinf, UFPR.
URI: http://hdl.handle.net/1884/110
Date: 2000

Files in this item

Files Size Format View
texto.pdf 478.4Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Search DSpace


Advanced Search

Browse

My Account