GP-genetic planning algorithm based on planning graph

  • Authors:

  • Ai-Xiang Chen;Li-Hua Wu;Yun-Fei Jiang;Xue-Nong Zhang

  • Affiliations:

  • Institute of Software, Sun Yat-Sen University, GuangZhou, China;Institute of Software, Sun Yat-Sen University, GuangZhou, China;Institute of Software, Sun Yat-Sen University, GuangZhou, China;Institute of Software, Sun Yat-Sen University, GuangZhou, China

  • Venue:
  • AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In recent years, a new planning algorithm, graph plan, is presented and has a great impact on the development of intelligent planning. In graph planning, the algorithm has two main phases: Firstly, a directed, leveled graph with two kinds of nodes and three kinds of edges is constructed according to the preconditions and effects of actions, the levels of planning graph alternate between proposition levels containing proposition nodes and action levels containing action nodes. Secondly, a valid plan is extracted from the planning graph. However the searching of the planning graph is very difficult and costly. In this paper, a way of coding chromosome based on the planning graph is given, and the genetic operators are defined. Accordingly the genetic planer, which uses the genetic algorithm to search for the planning solution, is developed. The experiment shows that the genetic planer is better than other planers in solving the large planning problem.