Author:
Wu Yunpeng,Zhang Weiming,Liu Zhong,Huang Jincai,Zhu Cheng
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Baral, C., Kreinovich, V., Trejo, R.: Computational complexity of planning and approximate planning in the presence of incompleteness. Artificial Intelligence 122(1-2), 241–267 (2000)
2. Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. Artificial Intelligence 90(1-2), 281–300 (1997)
3. Bonet, B., Geffner, H.: Planning as heuristic search. Artif. Intell. 129(1-2), 5–33 (2001)
4. Bylander, T.: Complexity results for planning. In: IJCAI 1991: Proceedings of the 12th International Joint Conference on Artificial Intelligence, pp. 274–279 (1991)
5. Bylander, T.: The computational complexity of propositional strips planning. Artificial Intelligence 69(1-2), 165–204 (1994)