Title :
Flexible Graphplan Based on Heuristic Searching
Author :
Han, Yi ; Gu, Wen Xiang ; Li, Yang ; Yin, Ming Hao ; Zhang, Jing Bo
Author_Institution :
Changchun Inst. of Opt., Chinese Acad. of Sci., Changchun
Abstract :
Classic graphplan has too much restriction on planning. Therefore this paper introduces the flexible planning. Basing on the advantage of heuristic searching, this paper introduces heuristic to the process of plan extracting in flexible graphplan and combines the two in order to reinforce them mutually. Hence the efficiency of plan extracting and the quality of plan are improved
Keywords :
graph theory; heuristic programming; planning (artificial intelligence); search problems; flexible graphplan; heuristic searching; plan extracting process; Artificial intelligence; Computer science; Cybernetics; Electronic mail; Machine learning; Physics; State estimation; State-space methods; Flexible Graphplan; Flexible planning; Heuristic searching;
Conference_Titel :
Machine Learning and Cybernetics, 2006 International Conference on
Conference_Location :
Dalian, China
Print_ISBN :
1-4244-0061-9
DOI :
10.1109/ICMLC.2006.258889
