Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Temporally Extended Goal Recognition in Fully Observable Non-Deterministic Domain Models (2306.08680v1)

Published 14 Jun 2023 in cs.AI

Abstract: Goal Recognition is the task of discerning the correct intended goal that an agent aims to achieve, given a set of goal hypotheses, a domain model, and a sequence of observations (i.e., a sample of the plan executed in the environment). Existing approaches assume that goal hypotheses comprise a single conjunctive formula over a single final state and that the environment dynamics are deterministic, preventing the recognition of temporally extended goals in more complex settings. In this paper, we expand goal recognition to temporally extended goals in Fully Observable Non-Deterministic (FOND) planning domain models, focusing on goals on finite traces expressed in Linear Temporal Logic (LTLf) and Pure Past Linear Temporal Logic (PLTLf). We develop the first approach capable of recognizing goals in such settings and evaluate it using different LTLf and PLTLf goals over six FOND planning domain models. Empirical results show that our approach is accurate in recognizing temporally extended goals in different recognition settings.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (15)
  1. Armentano G, Amandi A (2007) Plan recognition for interface agents. Artificial Intelligence Review 28(2):131–162
  2. Avrahami-Zilberbrand D, Kaminka GA (2005) Fast and Complete Symbolic Plan Recognition. In: IJCAI
  3. Bacchus F, Kabanza F (1998) Planning for temporally extended goals. Ann Math Artif Intell 22(1-2)
  4. Baier JA, McIlraith SA (2006) Planning with temporally extended goals using heuristic search. In: AAAI
  5. Bryce D, Buffet O (2008) 6th International Planning Competition: Uncertainty Part. International Planning Competition (IPC)
  6. De Giacomo G, Rubin S (2018) Automata-theoretic foundations of FOND planning for LTLf and LDLf𝑓{}_{f}start_FLOATSUBSCRIPT italic_f end_FLOATSUBSCRIPT goals. In: IJCAI
  7. De Giacomo G, Vardi M (2013) Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI
  8. De Giacomo G, Vardi M (2015) Synthesis for LTL and LDL on finite traces. In: IJCAI
  9. Geffner H, Bonet B (2013) A concise introduction to models and methods for automated planning. Morgan & Claypool Publishers
  10. Geib CW, Goldman RP (2009) A Probabilistic Plan Recognition Algorithm Based on Plan Tree Grammars. Artificial Intelligence 173(11)
  11. Pnueli A (1977) The temporal logic of programs. In: FOCS
  12. Ramírez M, Geffner H (2009) Plan Recognition as Planning. In: IJCAI
  13. Ramírez M, Geffner H (2010) Probabilistic plan recognition using off-the-shelf classical planners. In: AAAI
  14. Ramírez M, Geffner H (2011) Goal recognition over pomdps: inferring the intention of a pomdp agent. In: IJCAI
  15. Torres J, Baier JA (2015) Polynomial-time reformulations of LTL temporally extended goals into final-state goals. In: IJCAI
Citations (2)

Summary

We haven't generated a summary for this paper yet.