Creating or Destroying Objects Plan in the Graphplan Framework

Authors: Wen-xiang Gu, Zeng-yu Cai, Xin-mei Zhang, Gui-dong Jiang

Abstract:

At present, intelligent planning in the Graphplan framework is a focus of artificial intelligence. While the Creating or Destroying Objects Planning (CDOP) is one unsolved problem of this field, one of the difficulties, too. In this paper, we study this planning problem and bring forward the idea of transforming objects to propositions, based on which we offer an algorithm, Creating or Destroying Objects in the Graphplan framework (CDOGP). Compared to Graphplan, the new algorithm can solve not only the entire problems that Graphplan do, but also a part of CDOP. It is for the first time that we introduce the idea of object-proposition, and we emphasize the discussion on the representations of creating or destroying objects operator and an algorithm in the Graphplan framework. In addition, we analyze the complexity of this algorithm.

Keywords: Graphplan, object_proposition, Creating or destroying objects, CDOGP.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1332252

References:

[1] Blum and M. Furst. Fast planning through planning graph analysis. In Proc. 14th Int. Joint Conf. AI, pages 1636--1642, 1995.
[2] Blum and M. Furst. Fast planning through planning graph analysis. J. Artificial Intelligence, 90(1--2):281--300, 1997.
[3] Anderson, C. R.Shimith,D.E., and Weld,D.S.(1998).Conditional Effects in Graphplan. In Simmons, R., Velose, M .and Shimith,S.(eds.),Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (aips-98),pp.44-53.AAAIPress,melo Park..
[4] Avrim L. Blum and John C. Probabilistic Planning in the Graphplan Framework. In the 5th European Conference on Planning (ECP-99).URL: http://www-2.cs.cmu.edu/~jcl/papers/planning/ecp.ps.
[5] D.S.Weld, C.R Anderson, and D.E.Smith. Extending Graphplan to handle uncertainty and sensing actions. In AAAI98,1998. URL: http://www.cs.washington.edu/ai/sgp.html
[6] Hong, J ..Graph Construction and Anlysis as a Paradigm for Plan Recognition, Seventeenth National Conference on Artificial Intelligence, Austin, Texas, USA, Publisher: AAAI Press.pp774-779,2000.
[7] R.E. Fikes and N.J. Nilsson, STRIPS: a new approach to the application of theoren proving to problem solving, Artif. Intell. 2(1971) 189-208.
[8] McDermott D,et al .Planning:What is, What it could be An introduction to the Special Issue on Planning and Scheduling. Artificial Intelligence,1995,76:1-16.
[9] Maria Fox and Derek Long. PDDL2.1: An extension to PDDL for modeling time and metric resources. Technical report, University of Durham, UK, 2001. 61-124.
[10] H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. 13th Nat. Conf. AI, pages 1194--1201, 1996.