A NOVEL EXTENSION TO GRAPHPLAN ON A DYNAMIC SET OF OBJECTS
We introduce a novel extension to the classic Graphplan. Graphplan is based on the assumption that the initial set of objects is not changeable during planning. This assumption is not true in some cases. That is to say, the planning problems involving creating and destroying objects dynamically cant be solved with classic Graphplan. In this paper, classic Graphplan is extended to solve the planning problems that involve a dynamic set of objects. The format of goals and operators are also be modified accordingly. Our extension is given from the point of implementation view. This extension has broadened the application fields of the classic Graphplan.
Al planning Graphplan A dynamic set of objects Partially instantiated operators
HUA JIANG XIN HU DAN ZUO FENG-QI SONG
School of Computer Science, Northeast Normal University, Changchun 130117, China
国际会议
2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)
昆明
英文
1830-1834
2008-07-12(万方平台首次上网日期,不代表论文的发表时间)