DMCA
A new probabilistic plan recognition algorithm based on string rewriting (2008)
Cached
Download Links
- [homepages.inf.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- [www.aaai.org]
- [www.aiconferences.org]
- [www.aaai.org]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS |
| Citations: | 50 - 7 self |
BibTeX
@INPROCEEDINGS{Geib08anew,
author = {Christopher W. Geib and John Maraist and Robert P. Goldman},
title = {A new probabilistic plan recognition algorithm based on string rewriting},
booktitle = {In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS},
year = {2008},
pages = {81--89}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yappr). Yappr is based on weighted model counting, building its models using string rewriting rather than tree adjunction or other tree building methods used in previous work. Since model construction is often the most computationally expensive part of such algorithms, this results in significant reductions in the algorithm’s runtime.
