The Community for Technology Leaders
2013 Ninth International Conference on Computational Intelligence and Security (2012)
Guangzhou, China China
Nov. 17, 2012 to Nov. 18, 2012
ISBN: 978-1-4673-4725-9
pp: 159-162
ABSTRACT
In order to efficiently recognize the partially ordered or interleaved, multiple plans, treat the partial observability of the domains and exclude misleading actions, in this paper, we designed a new plan recognition algorithm based on extending and pruning the Explanation Graph and then implemented it using the VC++ programming language. The results of test experiment indicate that the algorithm we presented here can completely accomplish the expected effect. It can not only recognize the plan and goal of the agent being performed efficiently, but also predict the actions the agent will take, and can also exclude the misleading actions.
INDEX TERMS
Algorithm design and analysis, Educational institutions, Computer science, Probabilistic logic, Classification algorithms, Hidden Markov models, Artificial intelligence, ordering constraint, plan recognition, pruning
CITATION
Dan Zhang, Longmei Jie, Guoqiang Shao, "A New Plan Recognition Algorithm and its Implementation", 2013 Ninth International Conference on Computational Intelligence and Security, vol. 00, no. , pp. 159-162, 2012, doi:10.1109/CIS.2012.43
97 ms
(Ver 3.3 (11022016))