Skip to main content

Planning with Derived Predicates Through Rule-Action Graphs and Local Search Techniques

  • Conference paper
AI*IA 2005: Advances in Artificial Intelligence (AI*IA 2005)

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

Included in the following conference series:

Abstract

In classical domain-independent planning, derived predicates are predicates that the domain actions can only indirectly affect. Their truth in a state can be inferred by particular axioms, that enrich the typical operator description of a planning domain.

As discussed in [3,6], derived predicates are practically useful to express in a concise and natural way some indirect action effects, such as updates on the transitive closure of a relation. Moreover, compiling them away by introducing artificial actions and facts in the formalization is infeasible because, in the worst case, we have an exponential blow up of either the problem description or the plan length [6]. This suggests that is worth investigating new planning methods supporting derived predicates, rather than using existing methods with “compiled” problems.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Barret, A., Christianson, D., Friedman, M., Kwok, C., Golden, K., Penberthy, S., Sun, Y., Weld, D.: UCPOP User’s Manual T.R. 93-09-08d, University of Washington (1995)

    Google Scholar 

  2. Edelkamp, S., Hoffmann, J., Littman, M., Younes, H. (eds.): Abstract Booklet of the IPC-4 Planners (ICAPS 2004) (2004)

    Google Scholar 

  3. Edelkamp, S., Hoffmann, J.: PDDL2.2: The language for the Classic Part of the 4th International Planning Competition. T.R. no. 195: Institut für Informatik, Freiburg, Germany (2004)

    Google Scholar 

  4. Gerevini, A., Saetti, A., Serina, I.: Planning through Stochastic Local Search and Temporal Action Graphs. Journal of Artificial Intelligence Research 20, 239–290 (2003)

    MATH  Google Scholar 

  5. Gerevini, A., Saetti, A., Serina, I., Toninelli, P.: Planning with Derived Predicates through Rule-Action Graphs and Relaxed-Plan Heuristics, R.T. 2005-01-40, University of Brescia (2005)

    Google Scholar 

  6. Thièbaux, S., Hoffmann, J., Nebel, B.: Defense of PDDL Axioms. In: Proc. of the Eighteenth International Joint Conference on Artificial Intelligence (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gerevini, A., Saetti, A., Serina, I., Toninelli, P. (2005). Planning with Derived Predicates Through Rule-Action Graphs and Local Search Techniques. In: Bandini, S., Manzoni, S. (eds) AI*IA 2005: Advances in Artificial Intelligence. AI*IA 2005. Lecture Notes in Computer Science(), vol 3673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558590_18

Download citation

  • DOI: https://doi.org/10.1007/11558590_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29041-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics