Loading...
Please wait, while we are loading the content...
Similar Documents
A probabilistic plan recognition algorithm based on plan tree grammars
| Content Provider | CiteSeerX |
|---|---|
| Author | Geib, Christopher W. Maraist, John Goldman, Robert P. |
| Description | This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition al-gorithm called Yet Another Probabilistic Plan Recognizer, (Yappr). Yappr is based on weighted model counting, build-ing its models using string rewriting rather than tree adjunc-tion 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. |
| File Format | |
| Language | English |
| Publisher Institution | In press, doi:10.1016/j.artint.2009.01.003 |
| Access Restriction | Open |
| Subject Keyword | Weighted Model Counting Previous Work Tree Building Method Expensive Part Probabilistic Plan Recognition Algorithm Significant Reduction Probabilistic Plan Recognizer Model Construction Efficient Probabilistic Plan Recognition Al-gorithm Algorithm Runtime |
| Content Type | Text |
| Resource Type | Article |
