Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Welcome to the InfoSci Platform
The Planning Net: A Structure to Improve Planning Solvers with Petri Nets

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

Marcos A. Schreiner, Marcos A. Castilho, Fabiano Silva, Luis A. Kunzle, Razer A. N. R. Montaño
Copyright: © 2015 |Volume: 5 |Issue: 2 |Pages: 21
ISSN: 1947-928X|EISSN: 1947-9298|EISBN13: 9781466678248|DOI: 10.4018/ijncr.2015040102
Cite Article Cite Article

MLA

Schreiner, Marcos A., et al. "The Planning Net: A Structure to Improve Planning Solvers with Petri Nets." IJNCR vol.5, no.2 2015: pp.16-36. http://doi.org/10.4018/ijncr.2015040102

APA

Schreiner, M. A., Castilho, M. A., Silva, F., Kunzle, L. A., & Montaño, R. A. (2015). The Planning Net: A Structure to Improve Planning Solvers with Petri Nets. International Journal of Natural Computing Research (IJNCR), 5(2), 16-36. http://doi.org/10.4018/ijncr.2015040102

Chicago

Schreiner, Marcos A., et al. "The Planning Net: A Structure to Improve Planning Solvers with Petri Nets," International Journal of Natural Computing Research (IJNCR) 5, no.2: 16-36. http://doi.org/10.4018/ijncr.2015040102

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.