Probabilistic Contingent Planning Based on Hierarchical Task Network for High-Quality Plans

Deterministic hierarchical task network (HTN) planning assumes that planning evolves along a fully predictable path and neglects the quality of the plan in the partially observable environment. To bridge this research gap, this paper proposes an innovative probabilistic contingent HTN planner, named the High-Quality Contingent Planner (HQCP), designed to generate high-quality plans within partially observable contexts. Our methodology extends conventional HTN planning formalisms to accommodate for partial observability and assesses these extensions based on plan cost. Additionally, we propose a novel heuristic for high-quality plans and develop the integrated planning algorithm. These empirical studies verify the effectiveness and efficiency of the planner both in probabilistic contingent planning and in achieving plans of a high quality.

Authors

Institutions

Publication Details

Journal
Algorithms
Published
2025-04-09
DOI
https://doi.org/10.3390/a18040214
Citations
8
Primary Topic
AI-based Problem Solving and Planning
Type
article
Field-Weighted Citation Impact
19.85
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Probabilistic Contingent Planning Based on Hierarchical Task Network for High-Quality Plans

Armando Zhu, Xuqi Su, Kai Kang, Zi Li et al.
8 citations
Algorithms
AI-based Problem Solving and Planning
19.85
article

Probabilistic Contingent Planning Based on Hierarchical Task Network for High-Quality Plans

Armando Zhu, Xuqi Su, Kai Kang, Zi Li, Xiaoyu Liu, Di Wu, Peng Zhao, Keqin Li
article en
8 citations

Abstract

Deterministic hierarchical task network (HTN) planning assumes that planning evolves along a fully predictable path and neglects the quality of the plan in the partially observable environment. To bridge this research gap, this paper proposes an innovative probabilistic contingent HTN planner, named the High-Quality Contingent Planner (HQCP), designed to generate high-quality plans within partially observable contexts. Our methodology extends conventional HTN planning formalisms to accommodate for partial observability and assesses these extensions based on plan cost. Additionally, we propose a novel heuristic for high-quality plans and develop the integrated planning algorithm. These empirical studies verify the effectiveness and efficiency of the planner both in probabilistic contingent planning and in achieving plans of a high quality.

AlgorithmsVol. 18(4)
University of Canberra (AU), Peking University (CN), UNSW Sydney (AU), AMA Computer University (PH), Carnegie Mellon University (US)
Openalex Percentile: Top 1%
AI-based Problem Solving and Planning
19.85
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Probabilistic Contingent Planning Based on Hierarchical Task Network for High-Quality Plans — Armando Zhu, Xuqi Su, et al. · Algorithms (2025) | TGRS Research Map | TGRS