A Probabilistic Framework for Hierarchical Goal Recognition

• URL: http://arxiv.org/abs/2604.22256v1
• Date: Fri, 24 Apr 2026 05:58:30 GMT
• Title: A Probabilistic Framework for Hierarchical Goal Recognition
• Abstract summary: We introduce the first planning-based probabilistic framework for hierarchical goal recognition over Hierarchical Task Networks (HTNs)<n>We instantiate the framework by exploiting an HTN planner with a three-stage generative model for likelihood estimation.<n> Empirical results show improved recognition performance over the existing HTN-based recognizer on HTN benchmarks.
• Score: 16.673645178605938
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Goal recognition aims to infer an agent's goal from observations of its behaviour. In realistic settings, recognition can benefit from exploiting hierarchical task structure and reasoning under uncertainty. Planning-based goal recognition has made substantial progress over the past decade, but to the best of our knowledge no existing approach jointly integrates hierarchical task structure with probabilistic inference. In this paper, we introduce the first planning-based probabilistic framework for hierarchical goal recognition over Hierarchical Task Networks (HTNs). We instantiate the framework by exploiting an HTN planner with a three-stage generative model for likelihood estimation, yielding posterior distributions over goal hypotheses. Empirical results show improved recognition performance over the existing HTN-based recognizer on HTN benchmarks. Overall, the framework lays a foundation for probabilistic goal recognition grounded in hierarchical planning structure, moving goal recognition toward more practical settings.

Related papers

• Zero-Shot Goal Recognition with Large Language Models [6.023276947115864]
  Large language models have recently reached near-parity with classical planners on well-known planning domains.<n>Goal recognition is a complementary abductive task structurally better suited to LLM strengths.<n>This paper provides the first systematic zero-shot evaluation of frontier LLMs as goal recognisers on key classical PDDL benchmarks.
  arXiv  Detail & Related papers  (2026-05-14T18:56:06Z)
• PRTS: A Primitive Reasoning and Tasking System via Contrastive Representations [66.94988600664574]
  We present textbfPRTS (textbfPrimitive textbfReasoning and textbfTasking textbfSystem), a VLA foundation model that reformulates pretraining through Goal-Conditioned Reinforcement Learning.
  arXiv  Detail & Related papers  (2026-04-30T06:14:02Z)
• Beyond the Academic Monoculture: A Unified Framework and Industrial Perspective for Attributed Graph Clustering [75.50670592447219]
  Attributed Graph Clustering (AGC) is a fundamental unsupervised task that partitions nodes into cohesive groups by jointly modeling structural topology and node attributes.<n>This survey provides a comprehensive, industrially grounded review of AGC from three complementary perspectives.
  arXiv  Detail & Related papers  (2026-03-21T14:15:34Z)
• Probabilistic Active Goal Recognition [12.583886275683302]
  We adopt a probabilistic framework for Active Goal Recognition.<n>We propose an integrated solution that combines a joint belief update mechanism with a Monte Carlo Tree Search algorithm.<n>We show that our joint belief update significantly outperforms passive goal recognition.
  arXiv  Detail & Related papers  (2025-07-29T14:22:29Z)
• A Pre-training Framework for Relational Data with Information-theoretic Principles [57.93973948947743]
  We introduce Task Vector Estimation (TVE), a novel pre-training framework that constructs supervisory signals via set-based aggregation over relational graphs.<n>TVE consistently outperforms traditional pre-training baselines.<n>Our findings advocate for pre-training objectives that encode task heterogeneity and temporal structure as design principles for predictive modeling on relational databases.
  arXiv  Detail & Related papers  (2025-07-14T00:17:21Z)
• Goal Recognition using Actor-Critic Optimization [12.842382984993632]
  Deep Recognition using Actor-Critic Optimization (DRACO) is a novel approach based on deep reinforcement learning.<n>DRACO is the first goal recognition algorithm that learns a set of policy networks from unstructured data and uses them for inference.<n>It achieves state-of-the-art performance for goal recognition in discrete settings while not using the structured inputs used by existing approaches.
  arXiv  Detail & Related papers  (2024-12-31T16:44:20Z)
• Goal Recognition via Linear Programming [14.129476759815251]
  Research on Goal Recognition as Planning encompasses reasoning about the model of a planning task, the observations, and the goals using planning techniques. In this article, we design novel recognition approaches that rely on the Operator-Counting framework. We show how the new IP/LP constraints can improve the recognition of goals under both partial and noisy observability.
  arXiv  Detail & Related papers  (2024-04-11T17:34:35Z)
• SLOTH: Structured Learning and Task-based Optimization for Time Series Forecasting on Hierarchies [16.12477042879166]
  The hierarchical time series (HTS) forecasting includes two sub-tasks, i.e., forecasting and reconciliation. In this paper, we propose two novel tree-based feature integration mechanisms, i.e., top-down convolution and bottom-up attention. Unlike most previous reconciliation methods which either rely on strong assumptions or focus on coherent constraints only, we utilize deep neural optimization networks.
  arXiv  Detail & Related papers  (2023-02-11T10:50:33Z)
• Discrete Factorial Representations as an Abstraction for Goal Conditioned Reinforcement Learning [99.38163119531745]
  We show that applying a discretizing bottleneck can improve performance in goal-conditioned RL setups. We experimentally prove the expected return on out-of-distribution goals, while still allowing for specifying goals with expressive structure.
  arXiv  Detail & Related papers  (2022-11-01T03:31:43Z)
• Combining Task Predictors via Enhancing Joint Predictability [53.46348489300652]
  We present a new predictor combination algorithm that improves the target by i) measuring the relevance of references based on their capabilities in predicting the target, and ii) strengthening such estimated relevance. Our algorithm jointly assesses the relevance of all references by adopting a Bayesian framework. Based on experiments on seven real-world datasets from visual attribute ranking and multi-class classification scenarios, we demonstrate that our algorithm offers a significant performance gain and broadens the application range of existing predictor combination approaches.
  arXiv  Detail & Related papers  (2020-07-15T21:58:39Z)
• Long-Horizon Visual Planning with Goal-Conditioned Hierarchical Predictors [124.30562402952319]
  The ability to predict and plan into the future is fundamental for agents acting in the world. Current learning approaches for visual prediction and planning fail on long-horizon tasks. We propose a framework for visual prediction and planning that is able to overcome both of these limitations.
  arXiv  Detail & Related papers  (2020-06-23T17:58:56Z)
• Target-Embedding Autoencoders for Supervised Representation Learning [111.07204912245841]
  This paper analyzes a framework for improving generalization in a purely supervised setting, where the target space is high-dimensional. We motivate and formalize the general framework of target-embedding autoencoders (TEA) for supervised prediction, learning intermediate latent representations jointly optimized to be both predictable from features as well as predictive of targets.
  arXiv  Detail & Related papers  (2020-01-23T02:37:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.