DocumentCode
1935348
Title
CDOFF: Fast-Forward Planning for Creating or Destroying Objects
Author
Gu, Wen-xiang ; Sun, Ming-Si ; Cai, Dun-Bo
Author_Institution
Northeast Normal Univ., Changchun
Volume
6
fYear
2007
fDate
19-22 Aug. 2007
Firstpage
3133
Lastpage
3137
Abstract
Creating or destroying objects planning (CDOP) was put forward by Blum & Furst in 1995, and it hasn´t 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.
Keywords
graph theory; heuristic programming; planning (artificial intelligence); search problems; CDOP; creating or destroying objects planning; fast-forward planning; graph theory; heuristic search; object component; Algorithm design and analysis; Artificial intelligence; Computer science; Cybernetics; Intelligent robots; Knowledge representation; Machine learning; Process planning; Robot control; State-space methods; CDOFF; Heuristic function; Object component; Object-proposition;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2007 International Conference on
Conference_Location
Hong Kong
Print_ISBN
978-1-4244-0973-0
Electronic_ISBN
978-1-4244-0973-0
Type
conf
DOI
10.1109/ICMLC.2007.4370686
Filename
4370686
Link To Document