Abstract
The Graphplan algorithm exemplifies the speed-up achieveable with disjunctive representations that leverage opposing directions of refinement. It is in this spirit that we introduce Bsr-graphplan, a work in progress intended to address issues of scalability and expressiveness which are problematic for Graphplan. Specifically, we want to endow the planner with intelligent backtracking and full quantification of action schemata. Since Graphplan employs a backward chaining search, it lacks the necessary state information to efficiently support these mechanisms. We hypothesize that alternatively pointing the search in the direction of the goals provides an sufficient amelioration. Further, we demonstrate that a forward chaining search strategy can be competitive by enforcing ordering constraints on the developing plan prefix. This is accomplished by using operators of a plangraph constructed in a top-down fashion to extend the plan prefix, and by introducing an additional data structure – a constraint tree – which is constructed by regressing subgoal information through the graph operators.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blum, A., Furst, M.L.: Fast Planning Through Planning Graph Analysis. In: Proc. International Joint Conference on Artificial Intelligence, Montreal, Canada (1995)
Burgess, A., Steel, S.: Quantification in Generative Refinement Planning. In: Steel, S., Alami, R. (eds.) Recent Advances in AI Planning: Proceedings of the 4th European Conference on Planning, pp. 91–103. Springer, Heidelberg (1997)
Fikes, R.E., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artificial Intelligence 2(3-4), 189–208 (1971)
Fuchs, D., Fuchs, M.: Cooperation between Top-Down and Bottom-Up Theorem Provers. Journal of Artificial Intelligence Research 10, 169–198 (1999)
Kambhampati, S.: On the relations between intelligent backtracking and failuredriven explanation based learning in constraint satisfaction and planning. Artificial Intelligence 105(1-2), 161–208 (1998)
Kambhampati, S.: Refinement Planning as a Unifying Framework for Plan Synthesis. AI Magazine 18(2), 67–97 (1997)
Kambhampati, S., Parker, E., Lambrecht, E.: Understanding and Extending Graphplan. In: Steel, S., Alami, R. (eds.) Recent Advances in AI Planning: Proceedings of the 4th European Conference on Planning, pp. 260–272. Springer, Heidelberg (1997)
Lifschitz, V.: On the semantics of STRIPS. In: Proc. Reasoning about Actions and Plans, pp. 1–9. Morgan Kaufmann, San Francisco (1986)
McDermott, D.: The Current State of AI Planning Research. In: Invited paper, 9th Intl. Conf. on Industrial and Engineering Applications of AI and Expert Systems (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parker, E. (2000). Making Graphplan Goal-Directed. In: Biundo, S., Fox, M. (eds) Recent Advances in AI Planning. ECP 1999. Lecture Notes in Computer Science(), vol 1809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720246_26
Download citation
DOI: https://doi.org/10.1007/10720246_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67866-3
Online ISBN: 978-3-540-44657-6
eBook Packages: Springer Book Archive