Hybrid planning heuristics based on task decomposition graphs
| dc.contributor.author | Bercher, Pascal | en |
| dc.contributor.author | Keen, Shawn | en |
| dc.contributor.author | Biundo, Susanne | en |
| dc.date.accessioned | 2026-06-12T18:40:32Z | |
| dc.date.available | 2026-06-12T18:40:32Z | |
| dc.date.issued | 2014 | en |
| dc.description.abstract | Hybrid Planning combines Hierarchical Task Network (HTN) planning with concepts known from Partial-Order Causal-Link (POCL) planning. We introduce novel heuristics for Hybrid Planning that estimate the number of necessary modifications to turn a partial plan into a solution. These estimates are based on the task decomposition graph that contains all decompositions of the abstract tasks in the planning domain. Our empirical evaluation shows that the proposed heuristics can significantly improve planning performance. | en |
| dc.description.sponsorship | We want to thank Thomas Geier and Bernd Schattenberg for proofreading the paper. This work is done within the Transregional Collaborative Research Centre SFB/TRR 62 “Companion-Technology for Cognitive Technical Systems” funded by the German Research Foundation (DFG). | en |
| dc.description.status | Peer-reviewed | en |
| dc.format.extent | 9 | en |
| dc.identifier.isbn | 9781577356769 | en |
| dc.identifier.other | ORCID:/0000-0002-0795-4320/work/217270347 | en |
| dc.identifier.scopus | 85047787791 | en |
| dc.identifier.uri | https://hdl.handle.net/1885/733811276 | |
| dc.language.iso | en | en |
| dc.publisher | AAAI Press | en |
| dc.relation.ispartof | Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014 | en |
| dc.relation.ispartofseries | 7th Annual Symposium on Combinatorial Search, SoCS 2014 | en |
| dc.relation.ispartofseries | Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014 | en |
| dc.relation.isversionof | 1 | en |
| dc.rights | Publisher Copyright: Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. | en |
| dc.title | Hybrid planning heuristics based on task decomposition graphs | en |
| dc.type | Conference paper | en |
| dspace.entity.type | Publication | en |
| local.bibliographicCitation.lastpage | 43 | en |
| local.bibliographicCitation.startpage | 35 | en |
| local.contributor.affiliation | Bercher, Pascal; School of Computing, ANU College of Systems and Society, The Australian National University | en |
| local.contributor.affiliation | Keen, Shawn; Ulm University | en |
| local.contributor.affiliation | Biundo, Susanne; Ulm University | en |
| local.identifier.citationvolume | 5 | en |
| local.identifier.doi | 10.1609/socs.v5i1.18323 | en |
| local.identifier.pure | 3843ec43-18f9-4385-94ba-184501ef8dec | en |
| local.identifier.url | https://www.scopus.com/pages/publications/85047787791 | en |
| local.type.status | Published | en |
Downloads
Original bundle
1 - 1 of 1