mlsanityData to 14 Oct 2026

Probabilistic Active Goal Recognition

arXiv 2507.21846 ↗First posted 29 Jul 2025cs.AI cs.SCcited by 2

Not on the map. Why?

Abstract (arXiv)

In multi-agent environments, effective interaction hinges on understanding the beliefs and intentions of other agents. While prior work on goal recognition has largely treated the observer as a passive reasoner, Active Goal Recognition (AGR) focuses on strategically gathering information to reduce uncertainty. We adopt a probabilistic framework for Active Goal Recognition and propose an integrated solution that combines a joint belief update mechanism with a Monte Carlo Tree Search (MCTS) algorithm, allowing the observer to plan efficiently and infer the actor's hidden goal without requiring domain-specific knowledge. Through comprehensive empirical evaluation in a grid-based domain, we show that our joint belief update significantly outperforms passive goal recognition, and that our domain-independent MCTS performs comparably to our strong domain-specific greedy baseline. These results establish our solution as a practical and robust framework for goal inference, advancing the field toward more interactive and adaptive multi-agent systems.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 33 references that are in the map. First posted on arXiv 29 Jul 2025.

Builds on

7 of 33 references.

References · 7

  1. 2019Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithmscited by 567
  2. 2017Online algorithms for POMDPs with continuous state, action, and observation spacescited by 84
  3. 2024MuMA-ToM: Multi-modal Multi-Agent Theory of Mindcited by 51
  4. 2019Active Goal Recognitioncited by 16
  5. 2017Heuristic Online Goal Recognition in Continuous Domainscited by 11
  6. 2021Monte Carlo Information-Oriented Planningcited by 4
  7. 2021Active Sensing for Search and Tracking: A Reviewcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.