Skip to main content

An ACO Approach to Planning

  • Conference paper
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5482))

Abstract

In this paper we describe a first attempt to solve planning problems through an Ant Colony Optimization approach. We have implemented an ACO algorithm, called ACOPlan, which is able to optimize the solutions of propositional planning problems, with respect to the plans length. Since planning is a hard computational problem, metaheuristics are suitable to find good solutions in a reasonable computation time. Preliminary experiments are very encouraging, because ACOPlan sometimes finds better solutions than state of art planning systems. Moreover, this algorithm seems to be easily extensible to other planning models.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann, San Francisco (2004)

    MATH  Google Scholar 

  2. Hoffmann, J.: The metricff planning system: Translating ignoring delete lists to numerical state variables. Journal of Artificial Intelligence Research. Special issue on the 3rd International Planning Competition 20, 291–341 (2003)

    MATH  Google Scholar 

  3. Gupta, N., Nau, D.S.: On the complexity of blocks-world planning. Artificial Intelligence 56, 223–254 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dorigo, M., Stuetzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  5. Muslea, I.: Sinergy: A linear planner based on genetic programming. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 312–324. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  6. Gerevini, A., Serina, I.: LPG: a planner based on local search for planning graphs. In: Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002). AAAI Press, Toulouse (2002)

    Google Scholar 

  7. Kautz, H., Selman, B.: Unifying sat-based and graph-based planning. In: Proceedings of IJCAI 1999, Stockholm (1999)

    Google Scholar 

  8. Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129(1-2) (2001)

    Google Scholar 

  9. Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14, 253–302 (2001)

    MATH  Google Scholar 

  10. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics 26(1), 29–41 (1996)

    Article  Google Scholar 

  11. Stuetzle, T., Hoos, H.H.: Max min ant system. Future Generation Computer Systems (16), 889–914 (2000)

    Google Scholar 

  12. Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344(2-3), 243–278 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics – Part B 34(2), 1161–1172 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baioletti, M., Milani, A., Poggioni, V., Rossi, F. (2009). An ACO Approach to Planning. In: Cotta, C., Cowling, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2009. Lecture Notes in Computer Science, vol 5482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01009-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01009-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01008-8

  • Online ISBN: 978-3-642-01009-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics