DocumentCode :
423860
Title :
Fast probabilistic plan recognition without plan library
Author :
Yin, Ming-hao ; Ou, Hua-Jie ; Gu, Wen-xiang ; Lu, Yin-Hua ; Liu, Ri-xian
Author_Institution :
Dept. of Comput. Sci., Northeast Normal Univ., Changchun, China
Volume :
1
fYear :
2004
fDate :
26-29 Aug. 2004
Firstpage :
157
Abstract :
Instead of using a plan library, the recognizer introduced in this paper uses a compact structure called PGoalGraph to represent goals, actions and states of the world. This method doesn´t suffer the problem of acquisition and hand-coding a larger plan library as traditional methods do. The recognizer also extends classical methods in two directions. First, it doesn´t make the assumption that all the effects of an action are deterministic. Second, the recognizer can produce an optimal plan instead of producing a set of equally plausible plan hypothesis. Since the recognizer is a domain independent one, the method can be adapted in almost every domain.
Keywords :
probability; software agents; PGoalGraph; domain independent recognizer; fast probabilistic plan recognition; Algorithm design and analysis; Computer science; Explosions; Intelligent agent; Libraries; Light rail systems; Machine learning; Machine learning algorithms; Organizing; Robots;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN :
0-7803-8403-2
Type :
conf
DOI :
10.1109/ICMLC.2004.1380639
Filename :
1380639
Link To Document :
بازگشت