A Message Passing Algorithm for Plan Recognition
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 280-284.
Abstract
We present a general framework for plan recognition whose formulation is motivated by a general purpose algorithm for effective abduction. The knowledge representation is a restricted form of first order logic, which is made computationally explicit as a graph structure in which plans are manifest as a special kind of graph walk. Intuitively, plans are fabricated by searching an action description graph for relevant connections amongst instances of observed actions. The class of plans for which our method is applicable is wider than those previously proposed, as both recursive and optional plan components can be represented. Despite the increased generality, the proposed messagepassing algorithm has an asymptotic upper bound that is an improvement on previous related work.
@inproceedings{ijcai1991p42,
title = {A Message Passing Algorithm for Plan Recognition},
author = {Lin, Dekang and Goebel, Randy},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {280--284},
year = {1991},
month = {8},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1991/42},
}
TY - CPAPER TI - A Message Passing Algorithm for Plan Recognition AU - Lin, Dekang AU - Goebel, Randy T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 280 EP - 284 UR - https://ijcai.org/proceedings/1991/42 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
