Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Green, C.: Application of theorem proving to problem solving. In: Proc. 1st Int. Joint Conf. AI, pp. 219–239 (1969)
Fikes, R., Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 189–208 (1971)
Blum, A., Furst, M.: Fast planning through planning graph analysis. In: Proc. 14th Int. Joint Conf. AI, pp. 1636–1642 (1995)
Blum, A., Furst, M.: Fast planning through Planning Graph analysis. J. Artificial Intelligence 90(1-2), 281–300 (1997)
Daniel, S., Weld: Recent Advances in AI Planning. Technical Report UW-CSE-98-10-01. AI Magazine (1999)
Miguel, I., Jarvis, P., Shen, Q.: Flexible Graphplan. In: 14th European Conference on Artificial Intelligence (2000)
Miguel, I., Shen, Q.: Fuzzy rrDFGP and Planning. Artificial Intelligence 148, 11–52 (2003)
Miguel, I.: Dynamic flexible constraint satisfaction and its application to AI planning. Distinguished Dissertations (2004)
McDermott, D., et al.: Planning: What is, What it could be, An introduction to the Special Issue on Planning and Scheduling. Artificial Intelligence 76, 1–16 (1995)
Pedrycz, W., Gomide, F.: An Introduction to Fuzzy Sets: Analysis and Design. MIT Press, Cambridge (1999)
Kambhampati, R., Lambrecht, E., Parker, E.: Understanding and extending Graphplan. In: Proc. 4th European Conference on Planning (September 1997)
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)
McDermott, D., et al.: The PDDL Planning Domain Definition Language. In: The AIPS 1998 Planning Competition Committee (1998)
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)
Hoffmann, J., Nebel, B.: The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research 14, 253–302 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, L., Gu, WX., Zhang, XM. (2006). Backward-Chaining Flexible Planning. In: Yeung, D.S., Liu, ZQ., Wang, XZ., Yan, H. (eds) Advances in Machine Learning and Cybernetics. Lecture Notes in Computer Science(), vol 3930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11739685_1
Download citation
DOI: https://doi.org/10.1007/11739685_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33584-9
Online ISBN: 978-3-540-33585-6
eBook Packages: Computer ScienceComputer Science (R0)