Temporal Reasoning During Plan Recognition

This paper presents a strengthenedalgorithm for temporal reasoning during plan recognition, which improves on a straightforward application of Allen’ s reasoning algorithm. This is made possible by viewing plans as both hierarchical structures and temporal networks. As a result, we can show how to use as constraiuts the temporal relations explicitly given in input to improve the results of plan recognition. We also discusshow to combine the given constraintswith those prestored in the system’ s plan library to make more specific the temporal constraintsindicatedin the plans being recognised.

Authors

• Fei Song Robin Cohen

Keywords

No keywords are indexed for this paper.