Skip to main content

Concise Representations for State Spaces in Conformant Planning Tasks

  • Conference paper
  • 4770 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7473))

Abstract

Concise representations for state spaces in a conformant planning task based on the finite-domain representations are presented. The problems that literals in the finite-domain representations never used in a conformant planning task are analyzed. The paper proposed following methods: aborting void literal, translating the negative literal, and utilize domain transition graph to remove these literals. The experimental results show that the proposed methods can effectively reduce the size of state states.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldman, R.P., Boddy, M.S.: Expressive Planning and Explicit Knowledge. In: Proc. AIPS 1996 (1996)

    Google Scholar 

  2. Smith, D.E., Weld, D.S.: Conformant Graphplan. In: Proc. AAAI 1998 (1998)

    Google Scholar 

  3. Brafman, R.I., Hoffmann, J.: Conformant Planning via Heuristic Forward Search: A New Approach. J. Artif. Intell. Res. 14, 253–302 (2001)

    Google Scholar 

  4. Bonet, B., Givan, B.: Results of Conformant Track in the 5th International Planning Competition, http://ldc.usb.ve/~bonet/ipc5/docs/results-conformant.pdf

  5. Hakan, L., Younes, S., Michael, L.L.: PPDDL1.0: An Extension to PDDL for Expressing Planning Domains with Probabilistic Effects. Technical report CMU-CS-04-167, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA (2004)

    Google Scholar 

  6. Sanner, S., Yoon, S.: IPPC Results Presentation. In: Proc. ICAPS 2011, pp. 16–17 (2011)

    Google Scholar 

  7. Helmert, M.: Concise finite-domain representations for PDDL planning tasks. Artif. Intell. 173, 503–535 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Li, W.S., Zhang, Z., Wang, W.X.: CPT-FDR: An Approach to Translating PPDDL Conformant Planning Tasks into Finite-Domain Representations. Chinese J. Electro. 21, 53–58 (2012)

    MathSciNet  Google Scholar 

  9. Hoffmann, J., Nebel, B.: The FF Planning System: Fast Plan Generation through Heuristic Search. J. Artif. Intell. Res. 14, 253–302 (2001)

    MATH  Google Scholar 

  10. Helmert, M.: The Fast Downward Planning System. J. Artif. Intell. Res. 26, 191–246 (2006)

    Article  MATH  Google Scholar 

  11. Richter, S., Westphal, M.: The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks. J. Artif. Intell. Res. 39, 127–177 (2010)

    MATH  Google Scholar 

  12. Richter, S., Westphal, M., Helmert, M.: LAMA 2008 and 2011, http://www.informatik.uni-freiburg.de/~srichter/papers/richter-etal-ipc11.pdf

  13. Rintanen, J.: An Iterative Algorithm for Synthesizing Invariants. In: Proc. 17th National Conference on Artificial Intelligence. AAAI Press (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, W., Du, J., Zhou, L. (2012). Concise Representations for State Spaces in Conformant Planning Tasks. In: Liu, B., Ma, M., Chang, J. (eds) Information Computing and Applications. ICICA 2012. Lecture Notes in Computer Science, vol 7473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34062-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34062-8_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34061-1

  • Online ISBN: 978-3-642-34062-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics