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

作者：Peng Zhao, Xiaoyu Liu, Xuqi Su, Di Wu, Zi Li, Kai Kang, Keqin Li, Armando Zhu · 发表于：Algorithms · 年份：2025 · DOI：10.3390/a18040214 · 被引用次数：11 · 研究领域：AI-based Problem Solving and Planning、Robotic Path Planning Algorithms、Logic, Reasoning, and Knowledge

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.