Sequential Plan Recognition

Abstract: Plan recognition algorithms need to maintain all candidate hypotheses which are consistent with the observations, even though there is only a single hypothesis that is the correct one. Unfortunately, the number of possible hypotheses can be exponentially large in practice. This paper addresses the problem of how to disambiguate between many possible hypotheses that are all consistent with the actions of the observed agent. One way to reduce the number of hypotheses is to consult a domain expert or the acting agent directly about its intentions. This process can be performed sequentially, updating the set of hypotheses during the recognition process. The paper specifically addresses the problem of how to minimize the number of queries made that are required to find the correct hypothesis. It adapts a number of probing techniques for choosing which plan to query, such as maximal information gain and maximum likelihood. These approaches were evaluated on a domain from the literature using a well known plan recognition algorithm. The results showed that the information gain approach was able to find the correct plan using significantly fewer queries than the maximum likelihood approach as well as a baseline approach choosing random plans. Our technique can inform the design of future plan recognition systems that interleave the recognition process with intelligent interventions of their users.

Citation: Reuth Mirsky, Ya’akov Gal, Roni Stern, Meir Kalech. Sequential Plan Recognition. International Joint Conference on Artificial Intelligence (IJCAI), New York, USA, July 2016.

Download: http://bit.ly/2iR3wLf

About P. Andreadis

Pre-Doctoral Research Assistant in AI and Social Computation @ University of Edinburgh.

Leave a Reply