CDOFF: FAST-FORWARD PLANNING FOR CREATING OR DESTROYING OBJECTS
Creating or Destroying Objects Planning (CDOP) was put forward by Blum & Furst in 1995, and it hasnt been solved very well until now.In this paper, an approach based on heuristic search is proposed to solve this problem.The concept of object component is presented for the first time.Based on this concept, Refined CDOGP algorithm is designed to minimize the number of nodes in the graph and save some storage space at the same time.Partial relaxed planning task could avoid some dead-end states.Based on the goal distances and the utilization of resource, a novel heuristic function is designed in this paper, and it will lead the search to the direction to a better valid plan.The whole plan process is named Creating or Destroying Objects Fast-Forward Planning (CDOFF).It is a very significative research, because it can be applied in many fields.
Object component CDOFF Heuristic function Object-proposition
WEN-XIANG GU MING-SI SUN DUN-BO CAI
School of Computer Science, Northeast Normal University Changchun, Postal Code 130117, China School of Computer Science, Jilin University, Changchun, China
国际会议
2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)
香港
英文
3133-3137
2007-08-19(万方平台首次上网日期,不代表论文的发表时间)