DocumentCode :
2196873
Title :
A Plan Recognition Algorithm Based on the Probabilistic Goal Graph
Author :
Ying, Liu ; Wen-xiang, Gu
Author_Institution :
Sch. of Comput. Sci. & Inf. Technol., Northeast Normal Univ., Changchun, China
Volume :
1
fYear :
2011
fDate :
14-15 May 2011
Firstpage :
359
Lastpage :
362
Abstract :
Based on the Goal Graph, we construct a new structure named Probabilistic Goal Graph (PGG), which uses the goal nodes instead of state nodes, and adds the observation nodes. According to the background knowledge, we calculate the probability distribution of the observed actions, and then calculate the probability of each goal node, ultimately get an optimal plan which has maximum probability to achieve the goal. By putting the probabilistic values into the goal graph, it can be effectively recognized the partial observed actions, and overcomes the defects that the goal recognition algorithm can not find the optimal plan.
Keywords :
graph theory; probability; maximum probability; plan recognition algorithm; probabilistic goal graph; probability distribution; Knowledge based systems; Knowledge engineering; Planning; Prediction algorithms; Probabilistic logic; Probability distribution; goal graph; plan recognition; probabilistic goal graph;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Network Computing and Information Security (NCIS), 2011 International Conference on
Conference_Location :
Guilin
Print_ISBN :
978-1-61284-347-6
Type :
conf
DOI :
10.1109/NCIS.2011.79
Filename :
5948749
Link To Document :
بازگشت