Investigation of Different Seeding Strategies in a Genetic Planner

  • C. Henrik Westerberg
  • John Levine
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)


Planning is a difficult and fundamental problem of AI. An alternative solution to traditional planning techniques is to apply Genetic Programming. As a program is similar to a plan a Genetic Planner can be constructed that evolves plans to the plan solution. One of the stages of the Genetic Programming algorithm is the initial population seeding stage. We present five alternatives to simple random selection based on simple search. We found that some of these strategies did improve the initial population, and the efficiency of the Genetic Planner over simple random selection of actions.


Genetic Program Initial Population World State Depth First Search Random Action 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Westerberg, C.H.: An investigation into the use of using Genetic Programming to solve Classical Planning Problems. 4th Year CS/AI Project, Division of Informatics, University of Edinburgh, 2000Google Scholar
  2. 2.
    Westerberg, C.H., Levine, J.: “GenPlan”: Combining Genetic Programming and Planning. Proceedings for the UK Planning and Scheduling Special Interest Group 2000, Milton Keynes, UK, 2000Google Scholar
  3. 3.
    Spector, L.: Genetic Programming and AI Planning Systems. Proceedings of Twelfth National Conference on Artificial Intelligence, Seattle Washington USA AAAI Press/MIT Press, 1994Google Scholar
  4. 4.
    Muslea, I.: SINERGY: A Linear Planner Based on Genetic Programming. Proceedings of the 4th European Conference on Planning, 1997Google Scholar
  5. 5.
    Handley, S.G.: The automatic generations of plans for a mobile robot via genetic programming with automatically defined functions. In Advances in Genetic Programming, MIT Press, pages 391–407, 1994Google Scholar
  6. 6.
    Aler, R., Borrajo, D., Isasi, P.: GP Fitness Functions to Evolve Heuristics for Planning. Proceeding of the GECCO 2000 Conference, EvoPlan Workshop (2000)Google Scholar
  7. 7.
    Aler, R., Borrajo, D., Isasi, P.: Genetic Programming and deductive-inductive learning: A multistrategy approach. Proceedings of the Fifteenth International Conference on Machine Learning, ICML’98, Madison Wisconsin, (1998) 10–18Google Scholar
  8. 8.
    Koza, J.R.: Genetic Programming. The MIT Press, Cambridge MA (1992)zbMATHGoogle Scholar
  9. 9.
    Langdon, W.B., Nordin, J.P.: Seeding Genetic Programming Populations. Proceedings of the Third European Conference on Genetic Programming, EURO GP 2000, Edinburgh (2000)Google Scholar
  10. 10.
    Fikes, R.E., Nilsson, N.: STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 2 (1971) 189–208CrossRefzbMATHGoogle Scholar
  11. 11.
    Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165–204, (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming An Introduction. Morgan Kaufmann Publishers, San Francisco CA (1998)CrossRefzbMATHGoogle Scholar
  13. 13.
  14. 14.
    Tate, A., Hendler, J., Drummond, M.: A Review of AI Planning Techniques. Readings in Planning. Morgan Kaufmann Publishers, San Mateo CA (1990)Google Scholar
  15. 15.
    Weld, S.: An Introduction to least commitment planning. AI Magazine 15(4), (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • C. Henrik Westerberg
  • John Levine
    • 1
  1. 1.AI Applications InstituteUniversity of EdinburghEdinburghUK

Personalised recommendations