Comparing Plan Recognition Algorithms Through Standard Plan Libraries

Plan recognition deals with reasoning about the goals and execution process of an actor, given observations of its actions. It is one of the fundamental problems of AI, applicable to many domains, from user interfaces to cyber-security. Despite the prevalence of these approaches, they lack a standar...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers in artificial intelligence Vol. 4; p. 732177
Main Authors: Mirsky, Reuth, Galun, Ran, Gal, Kobi, Kaminka, Gal
Format: Journal Article
Language:English
Published: Switzerland Frontiers Media S.A 06.01.2022
Subjects:
Artificial Intelligence
plan libraries
plan recognition
standardization
theory of mind
plan libraries
standardization
theory of mind
plan recognition
artificial intelligence
ISSN:2624-8212, 2624-8212
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Plan recognition deals with reasoning about the goals and execution process of an actor, given observations of its actions. It is one of the fundamental problems of AI, applicable to many domains, from user interfaces to cyber-security. Despite the prevalence of these approaches, they lack a standard representation, and have not been compared using a common testbed. This paper provides a first step towards bridging this gap by providing a standard plan library representation that can be used by hierarchical, discrete-space plan recognition and evaluation criteria to consider when comparing plan recognition algorithms. This representation is comprehensive enough to describe a variety of known plan recognition problems and can be easily used by existing algorithms in this class. We use this common representation to thoroughly compare two known approaches, represented by two algorithms, SBR and Probabilistic Hostile Agent Task Tracker (PHATT). We provide meaningful insights about the differences and abilities of these algorithms, and evaluate these insights both theoretically and empirically. We show a tradeoff between expressiveness and efficiency: SBR is usually superior to PHATT in terms of computation time and space, but at the expense of functionality and representational compactness. We also show how different properties of the plan library affect the complexity of the recognition process, regardless of the concrete algorithm used. Lastly, we show how these insights can be used to form a new algorithm that outperforms existing approaches both in terms of expressiveness and efficiency.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
Edited by: Balaraman Ravindran, Indian Institute of Technology Madras, India
Present address: Reuth Mirsky, Department of Computer Science, Bar Ilan University, Ramat Gan, Israel
Mayukh Das, Microsoft Research, India
Reviewed by: Mostafa Haghi Kashani, Islamic Azad University, ShahreQods, Iran
This article was submitted to Machine Learning and Artificial Intelligence, a section of the journal Frontiers in Artificial Intelligence
ISSN:2624-8212
2624-8212
DOI:10.3389/frai.2021.732177