Incremental case-based plan recognition using state indices

DOI10.1007/3-540-44593-5_21MaRDI QIDQ2779849zbMATH OpenFDO

Authors Boris Kerkez, Michael T. Cox

Publication date 15 April 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2080/20800291

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Review text

We describe a case-based approach to the keyhole plan-recognition task where the observed agent is a state-space planner whose world states can be monitored. Case-based approach provides means for automatically constructing the plan library from observations, minimizing the number of extraneous plans in the library. We show that the knowledge about the states of the observed agent's world can be effectively used to recognize agent's plans and goals, given no direct knowledge about the planner's internal decision cycle. Cases (plans) containing state knowledge enable the recognizer to cope with novel situations for which no plans exist in the plan library, and to further assist in effective discrimination among competing plan hypothesis. For the entire collection see [Zbl 0968.68550].

Recommendations

• Case-based plan recognition with novel input
• Local predictions for case-based plan recognition
• A survey on case-based planning
• Case-based plan recognition in computer games
• Two Logical Theories of Plan Recognition

Cited in

(4)

• Case-based plan recognition in computer games
• Case-based plan recognition with novel input
• Local predictions for case-based plan recognition
• scientific article; zbMATH DE number 1869487 (Why is no real title available?)

This page was built for publication: Incremental case-based plan recognition using state indices

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