About: Property Directed Reachability for Automated Planning

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Property Directed Reachability for Automated Planning Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://jair.org/media/4231/live-4231-7958-jair.pdf
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, solving most problems on several domains. 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, solving most problems on several domains. (en)
Title	Property Directed Reachability for Automated Planning Property Directed Reachability for Automated Planning (en)
skos:prefLabel	Property Directed Reachability for Automated Planning Property Directed Reachability for Automated Planning (en)
skos:notation	RIV/00216208:11320/14:10283342!RIV15-GA0-11320___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP103/10/1287)
http://linked.open...iv/cisloPeriodika	50
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Suda, Martin
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	40343
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/14:10283342
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	graph; system; satisfiability; heuristic-search (en)
http://linked.open.../riv/klicoveSlovo	satisfiability graph system heuristic-search
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[B0A69820F937]
http://linked.open...i/riv/nazevZdroje	Journal of Artificial Intelligence Research
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	PlanEx: Bridging Planning and Execution
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	2014
http://linked.open...iv/tvurceVysledku	Suda, Martin
http://linked.open...ain/vavai/riv/wos	000339311300001
issn	1076-9757
number of pages	55 (xsd:int)
http://bibframe.org/vocab/doi	10.1613/jair.4231
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software