Tracking Branches in Trees - A Propositional Encoding for Solving Partially-Ordered HTN Planning Problems

Planning via SAT has proven to be an efficient and versatile planning technique. Its declarative nature allows for an easy integration of additional constraints and can harness the progress made in the SAT community without the need to adapt the planner. However, there has been only little attention...

Full description

Saved in:
Bibliographic Details
Main Authors: Behnke, Gregor, Holler, Daniel, Biundo, Susanne
Format: Conference Proceeding
Language:English
Subjects:
Compounds
Conferences
Encoding
hierarchical planning
Planning
SAT
Task analysis
Vegetation
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 80
container_issue
container_start_page 73
container_title
container_volume
creator Behnke, Gregor
Holler, Daniel
Biundo, Susanne
description Planning via SAT has proven to be an efficient and versatile planning technique. Its declarative nature allows for an easy integration of additional constraints and can harness the progress made in the SAT community without the need to adapt the planner. However, there has been only little attention to SAT planning for hierarchical domains. To ease encoding, existing approaches for HTN planning require additional assumptions, like non-recursiveness or totally-ordered methods. Both limit the expressiveness of HTN planning severely. We propose the first propositional encodings which are able to solve general, i.e., partially-ordered, HTN planning problems, based on a previous encoding for totally-ordered problems. The empirical evaluation of our encoding shows that it outperforms existing HTN planners significantly.
doi_str_mv 10.1109/ICTAI.2018.00022
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8576020</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8576020</ieee_id><sourcerecordid>8576020</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-86742c5592450c630abd85b79e2a36a3fd247c69e14419457533b26a676117d93</originalsourceid><addsrcrecordid>eNotj19LwzAAxKMgOOfeBV_yBVrzP81jLdMVhitYn0faphrNkpEUYd_eVX26g_tx3AFwh1GOMVIPddWWdU4QLnKEECEXYKVkgTkthGRMqUuwIFTyDGElr8FNSp9nCnFCF8C2Ufdf1r_Dx6h9_2EStB620ZxNBkvYxHAMyU42eO3g2vdhmOExRPga3PfsGx0nq507Zbs4mGgGuGlfYOO0979xDJ0zh3QLrkbtkln96xK8Pa3bapNtd891VW4ziyWfsnky6TlXhHHUC4p0NxS8k8oQTYWm40CY7IUymDGsGJec0o4ILaTAWA6KLsH9X681xuyP0R50PO0LLsX5M_0BptFWBw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Tracking Branches in Trees - A Propositional Encoding for Solving Partially-Ordered HTN Planning Problems</title><source>IEEE Xplore All Conference Series</source><creator>Behnke, Gregor ; Holler, Daniel ; Biundo, Susanne</creator><creatorcontrib>Behnke, Gregor ; Holler, Daniel ; Biundo, Susanne</creatorcontrib><description>Planning via SAT has proven to be an efficient and versatile planning technique. Its declarative nature allows for an easy integration of additional constraints and can harness the progress made in the SAT community without the need to adapt the planner. However, there has been only little attention to SAT planning for hierarchical domains. To ease encoding, existing approaches for HTN planning require additional assumptions, like non-recursiveness or totally-ordered methods. Both limit the expressiveness of HTN planning severely. We propose the first propositional encodings which are able to solve general, i.e., partially-ordered, HTN planning problems, based on a previous encoding for totally-ordered problems. The empirical evaluation of our encoding shows that it outperforms existing HTN planners significantly.</description><identifier>EISSN: 2375-0197</identifier><identifier>EISBN: 9781538674499</identifier><identifier>EISBN: 1538674491</identifier><identifier>DOI: 10.1109/ICTAI.2018.00022</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Compounds ; Conferences ; Encoding ; hierarchical planning ; Planning ; SAT ; Task analysis ; Vegetation</subject><ispartof>2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), 2018, p.73-80</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8576020$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,27916,54546,54923</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8576020$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Behnke, Gregor</creatorcontrib><creatorcontrib>Holler, Daniel</creatorcontrib><creatorcontrib>Biundo, Susanne</creatorcontrib><title>Tracking Branches in Trees - A Propositional Encoding for Solving Partially-Ordered HTN Planning Problems</title><title>2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)</title><addtitle>TAI</addtitle><description>Planning via SAT has proven to be an efficient and versatile planning technique. Its declarative nature allows for an easy integration of additional constraints and can harness the progress made in the SAT community without the need to adapt the planner. However, there has been only little attention to SAT planning for hierarchical domains. To ease encoding, existing approaches for HTN planning require additional assumptions, like non-recursiveness or totally-ordered methods. Both limit the expressiveness of HTN planning severely. We propose the first propositional encodings which are able to solve general, i.e., partially-ordered, HTN planning problems, based on a previous encoding for totally-ordered problems. The empirical evaluation of our encoding shows that it outperforms existing HTN planners significantly.</description><subject>Compounds</subject><subject>Conferences</subject><subject>Encoding</subject><subject>hierarchical planning</subject><subject>Planning</subject><subject>SAT</subject><subject>Task analysis</subject><subject>Vegetation</subject><issn>2375-0197</issn><isbn>9781538674499</isbn><isbn>1538674491</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2018</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj19LwzAAxKMgOOfeBV_yBVrzP81jLdMVhitYn0faphrNkpEUYd_eVX26g_tx3AFwh1GOMVIPddWWdU4QLnKEECEXYKVkgTkthGRMqUuwIFTyDGElr8FNSp9nCnFCF8C2Ufdf1r_Dx6h9_2EStB620ZxNBkvYxHAMyU42eO3g2vdhmOExRPga3PfsGx0nq507Zbs4mGgGuGlfYOO0979xDJ0zh3QLrkbtkln96xK8Pa3bapNtd891VW4ziyWfsnky6TlXhHHUC4p0NxS8k8oQTYWm40CY7IUymDGsGJec0o4ILaTAWA6KLsH9X681xuyP0R50PO0LLsX5M_0BptFWBw</recordid><startdate>201811</startdate><enddate>201811</enddate><creator>Behnke, Gregor</creator><creator>Holler, Daniel</creator><creator>Biundo, Susanne</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201811</creationdate><title>Tracking Branches in Trees - A Propositional Encoding for Solving Partially-Ordered HTN Planning Problems</title><author>Behnke, Gregor ; Holler, Daniel ; Biundo, Susanne</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-86742c5592450c630abd85b79e2a36a3fd247c69e14419457533b26a676117d93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Compounds</topic><topic>Conferences</topic><topic>Encoding</topic><topic>hierarchical planning</topic><topic>Planning</topic><topic>SAT</topic><topic>Task analysis</topic><topic>Vegetation</topic><toplevel>online_resources</toplevel><creatorcontrib>Behnke, Gregor</creatorcontrib><creatorcontrib>Holler, Daniel</creatorcontrib><creatorcontrib>Biundo, Susanne</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Behnke, Gregor</au><au>Holler, Daniel</au><au>Biundo, Susanne</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Tracking Branches in Trees - A Propositional Encoding for Solving Partially-Ordered HTN Planning Problems</atitle><btitle>2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)</btitle><stitle>TAI</stitle><date>2018-11</date><risdate>2018</risdate><spage>73</spage><epage>80</epage><pages>73-80</pages><eissn>2375-0197</eissn><eisbn>9781538674499</eisbn><eisbn>1538674491</eisbn><coden>IEEPAD</coden><abstract>Planning via SAT has proven to be an efficient and versatile planning technique. Its declarative nature allows for an easy integration of additional constraints and can harness the progress made in the SAT community without the need to adapt the planner. However, there has been only little attention to SAT planning for hierarchical domains. To ease encoding, existing approaches for HTN planning require additional assumptions, like non-recursiveness or totally-ordered methods. Both limit the expressiveness of HTN planning severely. We propose the first propositional encodings which are able to solve general, i.e., partially-ordered, HTN planning problems, based on a previous encoding for totally-ordered problems. The empirical evaluation of our encoding shows that it outperforms existing HTN planners significantly.</abstract><pub>IEEE</pub><doi>10.1109/ICTAI.2018.00022</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2375-0197
ispartof 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), 2018, p.73-80
issn 2375-0197
language eng
recordid cdi_ieee_primary_8576020
source IEEE Xplore All Conference Series
subjects Compounds
Conferences
Encoding
hierarchical planning
Planning
SAT
Task analysis
Vegetation
title Tracking Branches in Trees - A Propositional Encoding for Solving Partially-Ordered HTN Planning Problems
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T22%3A52%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Tracking%20Branches%20in%20Trees%20-%20A%20Propositional%20Encoding%20for%20Solving%20Partially-Ordered%20HTN%20Planning%20Problems&rft.btitle=2018%20IEEE%2030th%20International%20Conference%20on%20Tools%20with%20Artificial%20Intelligence%20(ICTAI)&rft.au=Behnke,%20Gregor&rft.date=2018-11&rft.spage=73&rft.epage=80&rft.pages=73-80&rft.eissn=2375-0197&rft.coden=IEEPAD&rft_id=info:doi/10.1109/ICTAI.2018.00022&rft.eisbn=9781538674499&rft.eisbn_list=1538674491&rft_dat=%3Cieee_CHZPO%3E8576020%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-86742c5592450c630abd85b79e2a36a3fd247c69e14419457533b26a676117d93%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8576020&rfr_iscdi=true