Probabilistic plan recognition based on algorithm of EG-Pruning

Proceedings of the 2006 International Conference on Machine Learning and Cybernetics

Volumn 2006, Issue , 2006, Pages 2237-2241

  Sun, Xiu Li ^a   Li, Yong Li ^a   Wang, Shu Hua ^a   Yin, Ming Hao ^a  

^a NORTHEAST NORMAL UNIVERSITY   (China)

Author keywords

EG Pruning; Hard ordering constraint; Plan recognition; Soft ordering constraint

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HIERARCHICAL SYSTEMS;

EG-PRUNING; HARD ORDERING CONSTRAINT; PLAN RECOGNITION; SOFT ORDERING CONSTRAINT;

PROBABILISTIC LOGICS;

EID: 33947258101     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLC.2006.258665     Document Type: Conference Paper

References (7)

1. Henry A. Kautz. A Formal Theory of Plan Recognition [Ph. D Thesis]. Rochester: University of Rochester. 1987.
2. Hung H. Bui, Svetha Venkatesh, Geoff West. Policy Recognition in the Abstract Hidden Markov Model. Journal of Artificial Intelligence Research 17(2002) 451-499.
3. David Pynadath and Michael Wellman. Probabilistic state-dependent grammars for plan recognition. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI-'00), pages 507-514, 2000.
4. Vilain, M. Getting serious about parsing plans: a grammatical analysis of plan recognition. In: Proceedings of the 8th National Conference on Artificial Intelligence Boston: AAAI Press, 1990. 190-197.
5. Robert P. Goldman, Christopher W. Geib, Christopher A. Miller. A New Model of Plan Recognition. In Proceedings of the 1999 Conference on Uncertainty in Artificial Intelligence, 1999.
6. Christopher W. Geib, Robert P. Goldman. Partial Observability and Probabilistic Plan/Goal Recognition. In: Proceedings of the IJCAI-05 Workshop on Modeling Others from Observations.
7. JIANG Yun-fei, MA Ning. A Plan Recognition Algorithm Based on Plan Knowledge Graph. Journal of Software, 1000-9825/2002/13(04) 0686-07