Work

Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence

Year: 2025

Type: conference-paper

Abstract: Plan verification is a canonical problem within any planning setting to ensure correctness. This problem is closely linked to the bounded plan existence problem. We analyze the complexity of these problems on lifted representations for Hierarchical Task Network (HTN) Planning. On top of the general analysis, we impose constraints on method orderings and the amount of tasks that methods decompose to. This pinpoints subclasses with lower complexity. Our results confirm the existence of more efficient algorithms when operating on the lifted, instead of grounded, representation.

Source: Proceedings of the International Conference on Automated Planning and Scheduling

DOI: 10.1609/icaps.v35i1.36102

Authors: Pascal Lauer, Songtuan Lin, Pascal Bercher

Institutions: Australian National University, Saarland University

Language: English

Topic: AI-based Problem Solving and Planning

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: Australian Government, Deutsche Forschungsgemeinschaft, Australian Research Council

Awards: G1951765764, SFB 1102: Informationsdichte und sprachliche Kodierung, Automated Modelling Assistance for the Creation of Complex Planning Models