Landmark-based approaches for goal recognition as planning

DOI10.1016/J.ARTINT.2019.103217MaRDI QIDQ2287208zbMATH OpenOpenAlexWikidataFDO

Authors Ramon Fraga Pereira, Nir Oren, Felipe Meneguzzi

Publication date 20 January 2020

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.11739

zbMATH Keywords

AI planninggoal recognitionlandmarks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Abstract: The task of recognizing goals and plans from missing and full observations can be done efficiently by using automated planning techniques. In many applications, it is important to recognize goals and plans not only accurately, but also quickly. To address this challenge, we develop novel goal recognition approaches based on planning techniques that rely on planning landmarks. In automated planning, landmarks are properties (or actions) that cannot be avoided to achieve a goal. We show the applicability of a number of planning techniques with an emphasis on landmarks for goal and plan recognition tasks in two settings: (1) we use the concept of landmarks to develop goal recognition heuristics; and (2) we develop a landmark-based filtering method to refine existing planning-based goal and plan recognition approaches. These recognition approaches are empirically evaluated in experiments over several classical planning domains. We show that our goal recognition approaches yield not only accuracy comparable to (and often higher than) other state-of-the-art techniques, but also substantially faster recognition time over such techniques.

Recommendations

• Goal recognition through goal graph analysis
• Cost-based goal recognition in navigational domains
• scientific article; zbMATH DE number 2243372
• Landmarks in hierarchical planning
• Decomposed planning guided by landmark counting heuristic

Cites work

• Autonomous agents modelling other agents: a comprehensive survey and open problems
• Fast planning through planning graph analysis
• Goal recognition through goal graph analysis
• scientific article; zbMATH DE number 5547847 (Why is no real title available?)
• scientific article; zbMATH DE number 2243372 (Why is no real title available?)
• Optimal Sokoban solving using pattern databases with specific domain knowledge
• Solving Simple Planning Problems with More Inference and No Search
• Sound and complete landmarks for and/Or graphs
• STRIPS: A new approach to the application of theorem proving to problem solving
• The computational complexity of propositional STRIPS planning
• The fast downward planning system
• The FF planning system: Fast plan generation through heuristic search
• The LAMA planner: guiding cost-based anytime planning with landmarks

Cited in

(9)

• Expecting the unexpected: goal recognition for rational and irrational agents
• Goal recognition through goal graph analysis
• Cost-based goal recognition in navigational domains
• Goal recognition design in deterministic environments
• A survey of opponent modeling in adversarial domains
• Anticipation of goals in automated planning
• Learning-driven goal generation
• Fast and accurate data-driven goal recognition using process mining techniques
• Special issue on autonomous agents modelling other agents: guest editorial

Describes a project that uses

Uses Software

• Graphplan
• PDDL

This page was built for publication: Landmark-based approaches for goal recognition as planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287208)