Backward-Chaining Flexible Planning
Different from all other congeneric research carried out before, this paper pays attention to a kind of planning problem that is more complex than the classical ones under the flexible Graph-plan framework. We present a novel approach for flexible planning based on a two-stage paradigm of graph expansion and solution extraction, which provides a new perspective on the flexible planning problem. In contrast to existing methods, the algorithm adopts backward-chaining strategy to expand the planning graphs, takes into account users’ requirement and taste, and finds a solution plan more suitable to the needs. Also, because of the wide application of intelligent planning, our research is very helpful in the development of robotology, natural language understanding, intelligent agents etc.
KeywordsPlanning Graph Satisfaction Degree Flexible Operator Graph Expansion Truth Degree
Unable to display preview. Download preview PDF.
- 1.Green, C.: Application of theorem proving to problem solving. In: Proc. 1st Int. Joint Conf. AI, pp. 219–239 (1969)Google Scholar
- 3.Blum, A., Furst, M.: Fast planning through planning graph analysis. In: Proc. 14th Int. Joint Conf. AI, pp. 1636–1642 (1995)Google Scholar
- 5.Daniel, S., Weld: Recent Advances in AI Planning. Technical Report UW-CSE-98-10-01. AI Magazine (1999)Google Scholar
- 6.Miguel, I., Jarvis, P., Shen, Q.: Flexible Graphplan. In: 14th European Conference on Artificial Intelligence (2000)Google Scholar
- 8.Miguel, I.: Dynamic flexible constraint satisfaction and its application to AI planning. Distinguished Dissertations (2004)Google Scholar
- 10.Pedrycz, W., Gomide, F.: An Introduction to Fuzzy Sets: Analysis and Design. MIT Press, Cambridge (1999)Google Scholar
- 11.Kambhampati, R., Lambrecht, E., Parker, E.: Understanding and extending Graphplan. In: Proc. 4th European Conference on Planning (September 1997)Google Scholar
- 12.Pednault, E.P.: ADL: Exploring the middle ground between STRIPS and the situation calculus. In: Proc. 1st International Conference (KR 1989), pp. 324–331 (1989)Google Scholar
- 13.McDermott, D., et al.: The PDDL Planning Domain Definition Language. In: The AIPS 1998 Planning Competition Committee (1998)Google Scholar
- 14.Kaukz, H., Selman, B.: Blackbox: A new approach to the application of theorem proving to problem solving. In: AIPS 1998 Workshop on Planning as Combinatorial Search, June 1998, pp. 58–60 (1998)Google Scholar