Hybrid Planning - Theoretical Foundations and Practical Applications
| dc.contributor.author | Bercher, Pascal | en |
| dc.date.accessioned | 2026-06-19T21:41:10Z | |
| dc.date.available | 2026-06-19T21:41:10Z | |
| dc.date.issued | 2015-06-07 | en |
| dc.description.abstract | The thesis presents a novel set-theoretic formalization of (propositional) hybrid planning – a planning framework that fuses Hierarchical Task Network (HTN) planning with Partial-Order Causal-Link (POCL) planning. Several sub classes thereof are identified that capture well-known problems such as HTN planning and POCL planning. For these problem classes, the complexity of the plan-existence problem is investigated, i.e., the problem of deciding whether there exists a solution for a given planning problem. For solving the problems of the respective problem classes, a hybrid planning algorithm is presented. Its search is guided by informed heuristics. Several such heuristics are introduced, both for POCL planning problems (i.e., problems without task hierarchy) and for hybrid planning problems (i.e., heuristics that are “hierarchy-aware”). | en |
| dc.description.status | Peer-reviewed | en |
| dc.format.extent | 6 | en |
| dc.identifier.other | ORCID:/0000-0002-0795-4320/work/217921798 | en |
| dc.identifier.uri | https://hdl.handle.net/1885/733811661 | |
| dc.language.iso | en | en |
| dc.relation.ispartofseries | 25th International Conference on Automated Planning and Scheduling, ICAPS 2015 | en |
| dc.title | Hybrid Planning - Theoretical Foundations and Practical Applications | en |
| dc.type | Conference paper | en |
| dspace.entity.type | Publication | en |
| local.contributor.affiliation | Bercher, Pascal; School of Computing, ANU College of Systems and Society, The Australian National University | en |
| local.identifier.pure | 1003963a-8f1c-4d74-a3bb-dbc618594887 | en |
| local.identifier.url | https://icaps15.icaps-conference.org/dc/ | en |
| local.type.status | Published | en |