Backward-Chaining flexible planning

Authors:
Li Xu;Wen-Xiang Gu;Xin-Mei Zhang
Affiliations:
School of Computer, Northeast Normal University, Changchun, Jilin, China;School of Computer, Northeast Normal University, Changchun, Jilin, China;School of Computer, Northeast Normal University, Changchun, Jilin, China
Venue:
ICMLC'05 Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics
Year:
2005

Citing 9
Cited 1

ADL: exploring the middle ground between STRIPS and the situation calculus

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Planning: what it is, what it could be, an introduction to the special issue on planning and scheduling

Artificial Intelligence - Special volume on planning and scheduling
Fast planning through planning graph analysis

Artificial Intelligence
Understanding and Extending Graphplan

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Dynamic Flexible Constraint Satisfaction and Its Application to Al Planning

Dynamic Flexible Constraint Satisfaction and Its Application to Al Planning
Fuzzy rrDFCSP and planning

Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
The FF planning system: fast plan generation through heuristic search

Journal of Artificial Intelligence Research
Application of theorem proving to problem solving

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Fast planning through planning graph analysis

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Bounded non-deterministic planning for multimedia adaptation

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.