{'fraction_non_alphanumeric': 0.02600216684723727, 'fraction_numerical': 0.004333694474539545, 'mean_word_length': 4.566265060240964, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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 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.