Skip to main content
SpringerLink
Log in

Generalizing the Relaxed Planning Heuristic to Non-linear Tasks

  • Conference paper
KI 2004: Advances in Artificial Intelligence (KI 2004)

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

Included in the following conference series:

Abstract

The relaxed planning heuristic is a prominent state-to-goal estimator function for domain-independent forward-chaining heuristic search and local search planning. It enriches the state-space traversal of almost all currently available suboptimal state-of-the-art planning systems.

While current domain description languages allow general arithmetic expressions in precondition and effect lists, the heuristic has been devised for propositional, restricted, and linear tasks only. On the other hand, generalizations of the heuristic to non-linear tasks are of apparent need for modelling complex planning problems and a true necessity to validate software. Subsequently, this work proposes a solid extension to the estimate that can deal with non-linear preconditions and effects. It is derived based on an approximated plan construction with respect to intervals for variable assignments. For plan extraction, weakest preconditions are computed according to the assignment rule in Hoare’s calculus.

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

Access this chapter

Log in via an institution
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. Bérard, B., Bidoit, A.F.M., Laroussine, F., Petit, A., Petrucci, L., Schoenebelen, P., McKenzie, P.: Systems and Software Verification. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  2. Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129(1–2), 5–33 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brafman, R., Hoffmann, J.: Conformant planning via heuristic forward search: A new approach. In: International Conference on Automated Planning and Scheduling (ICAPS), pp. 335–364 (2004)

    Google Scholar 

  4. Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3), 142–170 (1992)

    Article  Google Scholar 

  5. Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence, 165–204 (1994)

    Google Scholar 

  6. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)

    Google Scholar 

  7. Edelkamp, S.: Planning with pattern databases. In: European Conference on Planning (ECP), pp. 13–24 (2001)

    Google Scholar 

  8. Edelkamp, S.: Promela planning. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 197–212. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Edelkamp, S.: Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Research (JAIR) 20, 195–238 (2003)

    MATH  Google Scholar 

  10. Edelkamp, S.: Extended critical paths in temporal planning. In: Proceedings ICAPS-Workshop on Integrating Planning Into Scheduling, pp. 38–45 (2004)

    Google Scholar 

  11. Edelkamp, S., Hoffmann, J.: PDDL2.2: The language for the classical part of the 4th international planning competition. Technical report, University of Freiburg (2003)

    Google Scholar 

  12. Edelkamp, S., Hoffmann, J., Littman, M., Younes, H.: Proceedings Fourth International Planning Competition. In: International Conference on Automated Planning and Scheduling, Jet Propulsion Laboratory (2004)

    Google Scholar 

  13. Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology, STTT (2004)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  15. Fox, M., Long, D.: PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Research (JAIR) 20, 61–124 (2003)

    MATH  Google Scholar 

  16. Gazen, B.C., Knoblock, C.: Combining the expessiveness of UCPOP with the efficiency of graphplan. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  17. Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: Artificial Intelligence Planning and Scheduling (AIPS), pp. 140–149 (2000)

    Google Scholar 

  18. Hoffmann, J.: Local search topology in planning benchmarks: An empirical analysis. In: International Joint Conferences on Artificial Intelligence (IJCAI), pp. 453–458 (2001)

    Google Scholar 

  19. Hoffmann, J.: Local search topology in planning benchmarks: A theoretical analysis. In: Artificial Intelligence Planning and Scheduling (AIPS), pp. 379–387 (2002)

    Google Scholar 

  20. Hoffmann, J.: The Metric FF planning system: Translating “Ignoring the delete list” to numerical state variables. Journal of Artificial Intelligence Research 20, 291–341 (2003)

    MATH  Google Scholar 

  21. Hoffmann, J., Edelkamp, S., Englert, R., Liporace, F., Thiebaux, S.: Towards realistic benchmarks for planning: the domains used in the classical part of IPC-4. In: Proceedings Fourth International Planning Competition, pp. 8–15 (2004)

    Google Scholar 

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

    MATH  Google Scholar 

  23. McMillan, K.L.: Symbolic model checking. In: Inan, M.K., Kurshan, R.P. (eds.) Verification of Digital and Hybrid Systems, pp. 117–137. Springer, Heidelberg (1998)

    Google Scholar 

  24. Meriott, K., Stuckey, P.: Programming with Constraints. MIT Press, Cambridge (1998)

    Google Scholar 

  25. Pearl, J.: Heuristics. Addison-Wesley, Reading (1985)

    Google Scholar 

  26. Sanches, J., Tang, M., Mali, A.D.: P-MEP: Parallel more expressive planner. In: Proceedings Fourth International Planning Competition, pp. 53–55 (2004)

    Google Scholar 

  27. Sanchez, J., Mali, A.D.: S-MEP: A planner for numeric goals. In: Proceedings IEEE International Conference Tools with Artificial Intelligence (ICTAI), pp. 274–283 (2003)

    Google Scholar 

  28. van der Krogt, R., de Weerdt, M., Witteveen, C.: Exploiting opportunities using planning graphs. In: UK Planning and Scheduling SIG (PlanSig), pp. 125–136 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University Dortmund, Baroper Str. 301

    Stefan Edelkamp

Authors
  1. Stefan Edelkamp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Artificial Intelligence, Ulm University, Germany

    Susanne Biundo

  2. Fakultät für Ingenieurwissenschaften und Informatik, Universität Ulm, 89069, Ulm, v

    Thom Frühwirth

  3. Institute of Neural Information Processing, University of Ulm, D-89069, Ulm, Germany

    Günther Palm

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Edelkamp, S. (2004). Generalizing the Relaxed Planning Heuristic to Non-linear Tasks. In: Biundo, S., Frühwirth, T., Palm, G. (eds) KI 2004: Advances in Artificial Intelligence. KI 2004. Lecture Notes in Computer Science(), vol 3238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30221-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30221-6_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23166-0

  • Online ISBN: 978-3-540-30221-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation