Skip to main content

Directing the Search in the Fast Forward Planning

  • Conference paper
Advances in Computer Science and Engineering (CSICC 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 6))

Included in the following conference series:

  • 892 Accesses

Abstract

In this paper, we introduce DiFF, a novel extension of the Fast Forward (FF) planning system. FF is a domain independent planner that employs a forward heuristic search. Its search strategy is an enforced form of hill climbing. In order to move to a more promising state, FF evaluates successor states without any particular order. In this paper, we introduce a new form of the enforced hill climbing, which we call directed enforced hill climbing, to enhance the efficiency of Fast Forward planning. This strategy evaluates successor states in the order recommended by an adaptive heuristic function. Our experimental results in several planning domains show a significant improvement in the efficiency of the Fast Forward planning.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonet, B., Geffner, H.: HSP: Heuristic Search Planner. In: AIPS 1998 Planning Competition, Pittsburgh (1998)

    Google Scholar 

  2. Refanidis, I., Vlahavas, I.: The GRT planning system: Backward heuristic construction in forward state space planning. Journal of Artificial Intelligence Research 15, 115–161 (2001)

    Article  MATH  Google Scholar 

  3. Edelkamp, S., Helmert, M.: MIPS: The model checking integrated planning system. AI Magazine 22, 67–71 (2001)

    Google Scholar 

  4. Nguyen, X., Kambhampati, S.: Extracting effective and admissible state space heuristics from planning-graph. In: AAAI 2002 (2002)

    Google Scholar 

  5. Hoffmann, J.: The Metric-FF planning system: Translating ignoring delete lists to numeric state variables. Journal of Artificial Intelligence 20, 291–341 (2003)

    MATH  Google Scholar 

  6. Brafman, R., Hoffmann, J.: Conformant planning via heuristic forward search: A new approach. In: 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), Whistler, Canada (2004)

    Google Scholar 

  7. Helmert, M.: Fast Downward: Making use of causal dependencies in the problem representation. In: IPC 2004 (2004)

    Google Scholar 

  8. Vidal, V.: A Lookahead Strategy for Heuristic Search Planning. In: Fourteenth International Conference on Automated Planning and Scheduling ICAPS 2004, pp. 150–159 (2004)

    Google Scholar 

  9. Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 189–208 (1971)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akramifar, S.A., Ghassem-Sani, G. (2008). Directing the Search in the Fast Forward Planning. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_119

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89985-3_119

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89984-6

  • Online ISBN: 978-3-540-89985-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics