A Probabilistic Analysis of Marker-Passing Techniques for Plan-Recognition
This addresses a chronic issue in plan recognition for AI systems, but it appears incremental as it builds on existing marker-passing techniques.
The paper tackled the problem of useless paths in marker-passing techniques for plan recognition by using a probabilistic analysis to justify a method for quickly identifying and rejecting these paths, and it identified key conditions and assumptions necessary for marker-passing to perform well.
Useless paths are a chronic problem for marker-passing techniques. We use a probabilistic analysis to justify a method for quickly identifying and rejecting useless paths. Using the same analysis, we identify key conditions and assumptions necessary for marker-passing to perform well.