Skip to main content

An Investigation on Genetic Algorithms for Generic STRIPS Planning

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3315))

Abstract

We investigate the technique of genetic algorithms to solve the class of STRIPS planning problems in Artificial Intelligence. We define a genetic algorithm called AgPlan and we compare it with some recent planners.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fikes, R., Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Journal of Artificial Intelligence 2 (1971)

    Google Scholar 

  2. Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence 69, 165–205 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kautz, H., Selman, B.: Planning as satisfiability. In: Proc. 10th Eur. Conf. AI, Vienna, Austria, pp. 359–363. Wiley, Chichester (1992)

    Google Scholar 

  4. Blum, A., Furst, M.: Fast planning through planning graph analysis. In: Proceedings of IJCAI 1995, Montreal, pp. 1636–1642 (1995)

    Google Scholar 

  5. Vossen, T., Ball, M., Lotem, A., Nau, D.: On the use of integer programming models in ai planning. In: Proceedings of the IJCAI 1999, pp. 304–309 (1999)

    Google Scholar 

  6. Beek, P., Chen, X.: CPlan: A constraint programming approach to planning. In: Proc. of the Sixteenth National Conference on AI (AAAI 1999), pp. 585–590 (1999)

    Google Scholar 

  7. Silva, F., Castilho, M., Künzle, L.: Petriplan: a new algorithm for plan generation (preliminary report). In: Proc. of IBERAMIA/SBIA-2000, pp. 86–95. Springer, Heidelberg (2000)

    Google Scholar 

  8. Lin, F.: A planner called r. In: AIPS-2000 Planning Competition (2000)

    Google Scholar 

  9. Bonet, B., Geffner, H.: HSP: Planning as heuristic search. In: Entry at the AIPS 1998 Planning Competition, Pittsburgh (1998)

    Google Scholar 

  10. Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. In: AIPS Planning Competition (2000)

    Google Scholar 

  11. Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  12. Westerberg, C., Levine, J.: Combining genetic programming and planning. In: Proceedings for the UK Planning and Scheduling Special Interest Group, Milton Keynes UK (2000)

    Google Scholar 

  13. Muslea, I.: SINERGY: A linear planner based on genetic programming. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 314–326. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  14. Geffner, H.: Perspectives on artificial intelligence planning. In: Proc. 18th Nat (US) Conference on AI (2002), pp. 1013–1023 (2002)

    Google Scholar 

  15. McDermott, D.: PDDL - The Planning Domain Definition Language (1998), http://ftp.cs.yale.edu/pub/mcdermott

  16. Lecheta, E.M.: Algoritmos genticos para planejamento em inteligncia artificial. Master’s thesis, Dinf-UFPR (2004)

    Google Scholar 

  17. Koehler, J.: IPP home page (1997)

    Google Scholar 

  18. Kautz, H., Selman, B.: Unifying sat-based and graph-based planning. In: Proceedings of IJCAI, Stockholm, Sweden, pp. 318–325. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  19. McDermott, D.: AIPS-98 Planning Competition Results (1998), http://ftp.cs.yale.edu/pub/mcdermott/aipscomp-results.html

  20. Aips-2000 planning competition (2000)

    Google Scholar 

  21. Benke, D., Brand, V., Lima, S.: Uma avaliao de desempenho de planejadores. Technical report, Departamento de Informtica - UFPR, Curitiba, Brasil (2003)

    Google Scholar 

  22. Long, D., Fox, M.: Automatic synthesis and use of generic types in planning. In: Artificial Intelligence Planning Systems, pp. 196–205 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castilho, M., Kunzle, L.A., Lecheta, E., Palodeto, V., Silva, F. (2004). An Investigation on Genetic Algorithms for Generic STRIPS Planning. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30498-2_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23806-5

  • Online ISBN: 978-3-540-30498-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics