About: Relaxing the Relaxed Exist-Step Parallel Planning Semantics     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)

AttributesValues
rdf:type
Description
  • Solving planning problems via translation to satisfiability (SAT) is one of the most successful approaches to automated planning. We propose a new encoding scheme which encodes a planning problem represented in the SAS+ formalism using a relaxed Exist-Step semantics of parallel actions. The encoding by design allows more actions to be put inside one parallel step than other encodings and thus a planning problem can be solved with fewer SAT solver calls. The experiments confirm this property. In several non-trivial cases the entire plans fit inside only one parallel step. In our experiments we also compared our encoding with other state-of-the-art encodings such as SASE and Rintanen's Exist-Step encoding using standard IPC benchmark domains. Our encoding can outperform both these encodings in the number of solved problems within a given limit as well as in the number of SAT solver calls needed to find a plan.
  • Solving planning problems via translation to satisfiability (SAT) is one of the most successful approaches to automated planning. We propose a new encoding scheme which encodes a planning problem represented in the SAS+ formalism using a relaxed Exist-Step semantics of parallel actions. The encoding by design allows more actions to be put inside one parallel step than other encodings and thus a planning problem can be solved with fewer SAT solver calls. The experiments confirm this property. In several non-trivial cases the entire plans fit inside only one parallel step. In our experiments we also compared our encoding with other state-of-the-art encodings such as SASE and Rintanen's Exist-Step encoding using standard IPC benchmark domains. Our encoding can outperform both these encodings in the number of solved problems within a given limit as well as in the number of SAT solver calls needed to find a plan. (en)
Title
  • Relaxing the Relaxed Exist-Step Parallel Planning Semantics
  • Relaxing the Relaxed Exist-Step Parallel Planning Semantics (en)
skos:prefLabel
  • Relaxing the Relaxed Exist-Step Parallel Planning Semantics
  • Relaxing the Relaxed Exist-Step Parallel Planning Semantics (en)
skos:notation
  • RIV/00216208:11320/13:10139804!RIV14-GA0-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP103/10/1287), S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 102244
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/13:10139804
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • exist-step; SAS; encoding; satisfiability; planning (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [BEFC0A5F32F5]
http://linked.open...v/mistoKonaniAkce
  • Washington, DC, USA
http://linked.open...i/riv/mistoVydani
  • Washington, DC, USA
http://linked.open...i/riv/nazevZdroje
  • Proceedings 25th International Conference on Tools with Artificial Intelligence ICTAI 2013
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Balyo, Tomáš
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
issn
  • 1082-3409
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE Computer Society Conference Publishing Services (CPS)
https://schema.org/isbn
  • 978-1-4799-2971-9
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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