Skip to main content

A Robust Heuristic for the Multidimensional A-star/Wavefront Hybrid Planning Algorithm

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2015)

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

Included in the following conference series:

Abstract

Automated planning using heuristic search or gradient algorithms is a feasible method for solving many planning problems. However, if planning is performed for several (possibly colliding) entities, the size of the state space increases dramatically. If these entities have limited predictability, observability or controllability, a single plan can no longer suffice, and robust multi-variant planning is no longer feasible due to scale. This paper presents the A-star/Wavefront hybrid planning algorithm and proposes a new heuristic for selection of its deviation zones.

This work is supported by the Polish National Science Centre (NCN) grant 2011/01/D/ST6/06146.

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. Turek, W., Cetnarowicz, K., Zaborowski, W.: Software agent systems for improving performance of multi-robot groups. Fundam. Inf. 112(1), 103–117 (2011)

    Google Scholar 

  2. Blaszczyk, P., Turek, W., Cetnarowicz, K.: Formal model for micro-scale traffic simulation and control. In: 2013 18th International Conference on Methods and Models in Automation and Robotics (MMAR), pp. 305–310 (August 2013)

    Google Scholar 

  3. Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers Inc., San Francisco (2004)

    Google Scholar 

  4. Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Pearson Education (2010)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Klimek, R., Wojnicki, I., Ernst, S.: State-space reduction through preference modeling. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2013, Part II. LNCS (LNAI), vol. 7895, pp. 363–374. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)

    Article  Google Scholar 

  8. Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A*. J. ACM 32(3), 505–536 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wojnicki, I., Ernst, S., Turek, W. (2015). A Robust Heuristic for the Multidimensional A-star/Wavefront Hybrid Planning Algorithm. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2015. Lecture Notes in Computer Science(), vol 9120. Springer, Cham. https://doi.org/10.1007/978-3-319-19369-4_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19369-4_26

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19368-7

  • Online ISBN: 978-3-319-19369-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics