DocumentCode :
2339991
Title :
Research on plan recognition based on flexible graphplan
Author :
Li, Ye ; Zhu, Huidong ; Cai, Zengyu ; Li, Xiaofeng
Author_Institution :
Sch. of Comput. & Commun. Eng., Zhengzhou Univ. of Light Ind., Zhengzhou, China
fYear :
2012
fDate :
3-5 June 2012
Firstpage :
964
Lastpage :
967
Abstract :
Plan recognition is a focus of Artificial Intelligence. In this paper, combined with a flexible planning approach, a flexible plan recognition method which is based on the flexible planning is given, and the construction process of flexible planning is supplied. Based on these, we design the method of flexible goal graph extending, give the main theoretical analysis of the goal graph, and greatly reduce the flexibility of the size of the goal graph by using the pruning method. At the same time, it limits the scope that the agent can do in planning. The algorithm can get the most reasonable plan that the observed agent may adopt in a lot of planning space.
Keywords :
graph theory; planning (artificial intelligence); artificial intelligence; flexible goal graph; flexible graphplan; flexible plan recognition method; flexible planning approach; pruning method; Robots; Artificial intelligence; Flexible graphplan; Plan recognition; Satisfaction;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Robotics and Applications (ISRA), 2012 IEEE Symposium on
Conference_Location :
Kuala Lumpur
Print_ISBN :
978-1-4673-2205-8
Type :
conf
DOI :
10.1109/ISRA.2012.6219355
Filename :
6219355
Link To Document :
بازگشت