• Login
    View Item 
    •   DSpace Home
    • BIBLIOTECA DIGITAL: Teses & Dissertações
    • Teses & Dissertações
    • View Item
    •   DSpace Home
    • BIBLIOTECA DIGITAL: Teses & Dissertações
    • Teses & Dissertações
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Algoritmo para Planificação Baseada em STRIPS

    Thumbnail
    View/Open
    texto.pdf (478.4Kb)
    Date
    2000
    Author
    Silva, Fabiano
    Metadata
    Show full item record
    Subject
    planificacao em inteligencia artificial
    alcançabilidade
    sub-marcacao
    xmlui.dri2xhtml.METS-1.0.item-type
    Dissertação
    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.
    URI
    http://hdl.handle.net/1884/110
    Collections
    • Teses & Dissertações [5795]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_typeThis CollectionBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_type

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV