Property Directed Reachability for Automated Planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10283342" target="_blank" >RIV/00216208:11320/14:10283342 - isvavai.cz</a>
Result on the web
<a href="http://jair.org/media/4231/live-4231-7958-jair.pdf" target="_blank" >http://jair.org/media/4231/live-4231-7958-jair.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1613/jair.4231" target="_blank" >10.1613/jair.4231</a>
Alternative languages
Result language
angličtina
Original language name
Property Directed Reachability for Automated Planning
Original language description
Property Directed Reachability (PDR) is a very promising recent method for deciding reachability in symbolically represented transition systems. While originally conceived as a model checking algorithm for hardware circuits, it has already been successfully applied in several other areas. This paper is the first investigation of PDR from the perspective of automated planning. Similarly to the planning as satisfiability paradigm, PDR draws its strength from internally employing an efficient SAT-solver. We show that most standard encoding schemes of planning into SAT can be directly used to turn PDR into a planning algorithm. As a non-obvious alternative, we propose to replace the SAT-solver inside PDR by a planningspecific procedure implementing the same interface. This SAT-solver free variant is not only more efficient, but offers additional insights and opportunities for further improvements. An experimental comparison to the state of the art planners finds it highly competitive, solv
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Bridging Planning and Execution</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Artificial Intelligence Research
ISSN
1076-9757
e-ISSN
—
Volume of the periodical
2014
Issue of the periodical within the volume
50
Country of publishing house
US - UNITED STATES
Number of pages
55
Pages from-to
265-319
UT code for WoS article
000339311300001
EID of the result in the Scopus database
—