Relaxing the Relaxed Exist-Step Parallel Planning Semantics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10139804" target="_blank" >RIV/00216208:11320/13:10139804 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Relaxing the Relaxed Exist-Step Parallel Planning Semantics
Original language 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 severalnon-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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
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
Article name in the collection
Proceedings 25th International Conference on Tools with Artificial Intelligence ICTAI 2013
ISBN
978-1-4799-2971-9
ISSN
1082-3409
e-ISSN
—
Number of pages
7
Pages from-to
865-871
Publisher name
IEEE Computer Society Conference Publishing Services (CPS)
Place of publication
Washington, DC, USA
Event location
Washington, DC, USA
Event date
Nov 4, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—