Skip to main content

Planning with Action Prioritization and New Benchmarks for Classical Planning

  • Conference paper
AI 2012: Advances in Artificial Intelligence (AI 2012)

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

Included in the following conference series:

Abstract

We introduce a new class of planning problems in which there is a separate set of actions with higher priority than regular actions. We present new planning domains to show that problems of practical interest may easily fit in this framework. We argue that though this framework is quite succinctly encoded in classical planning itself, existing planners are disappointingly inept at solving them. To demonstrate this, we have built a wrapper tool for planners which uses ad-hoc techniques to give far better results. Therefore, we also propose our encoded domains as new challenges for general-purpose planners.

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. Fikes, R., Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2(3/4), 189–208 (1971)

    Article  MATH  Google Scholar 

  2. Blum, A., Furst, M.: Fast planning through planning graph analysis. Artificial Intelligence 90(1-2), 281–300 (1997)

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  4. Gerevini, A., Serina, I.: LPG: a planner based on local search for planning graphs with action costs. In: Proc. ICAPS, pp. 12–22 (2002)

    Google Scholar 

  5. Russell, S., Norvig, P.: Artificial intelligence: A Modern Approach, 2nd edn., ch. 11. Prentice Hall of India Private Limited, New Delhi (2006)

    Google Scholar 

  6. Thiébaux, S., Cordier, M.: Supply restoration in power distribution systems: A benchmark for planning under uncertainty. In: Pre-Proc. 6th European Conference on Planning (ECP 2001), pp. 85–96 (2001)

    Google Scholar 

  7. Chen, Y., Zhao, X., Zhang, W.: Long-distance mutual exclusion for propositional planning. In: Proc. IJCAI, pp. 1840–1845 (2007)

    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

Ghosh, K., Dasgupta, P., Ramesh, S. (2012). Planning with Action Prioritization and New Benchmarks for Classical Planning. In: Thielscher, M., Zhang, D. (eds) AI 2012: Advances in Artificial Intelligence. AI 2012. Lecture Notes in Computer Science(), vol 7691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35101-3_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35101-3_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35100-6

  • Online ISBN: 978-3-642-35101-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics