IDEAS home Printed from https://ideas.repec.org/a/igg/jncr00/v5y2015i2p16-36.html
   My bibliography  Save this article

The Planning Net: A Structure to Improve Planning Solvers with Petri Nets

Author

Listed:
  • Marcos A. Schreiner

    (Department of Informatics, Federal University of Paraná, Curitiba, Brazil)

  • Marcos A. Castilho

    (Department of Informatics, Federal University of Paraná, Curitiba, Brazil)

  • Fabiano Silva

    (Department of Informatics, Federal University of Paraná, Curitiba, Brazil)

  • Luis A. Kunzle

    (Department of Informatics, Federal University of Paraná, Curitiba, Brazil)

  • Razer A. N. R. Montaño

    (Department of Informatics, Federal University of Paraná, Curitiba, Brazil)

Abstract

In this paper the classical planning problem is formalized as a Petri Net. The authors review the Graphplan notions of mutex relation and maintenance actions based on the Petri Net flow. They also classify pairs of conflicting actions in terms of four different control structures, which are used to build the Plan Net. In addition the authors present the order relation of propositions, i.e., pairs of conflicting propositions that allow inclusion of more information in the Planning Net. The planning problem represented on Planning Net is translated into a SAT instance and solved by a modern SAT solver. The authors show the advantages provided by the inclusion of the propositions ordering relation and compare their experimental results with Satplan.

Suggested Citation

  • Marcos A. Schreiner & Marcos A. Castilho & Fabiano Silva & Luis A. Kunzle & Razer A. N. R. Montaño, 2015. "The Planning Net: A Structure to Improve Planning Solvers with Petri Nets," International Journal of Natural Computing Research (IJNCR), IGI Global, vol. 5(2), pages 16-36, April.
    • Handle: RePEc:igg:jncr00:v:5:y:2015:i:2:p:16-36
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijncr.2015040102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jncr00:v:5:y:2015:i:2:p:16-36. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.