Skip to main content

A Study of New Path Planning Algorithm Using Extended A* Algorithm with Survivability

  • Conference paper
Intelligent Robotics and Applications (ICIRA 2012)

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

Included in the following conference series:

Abstract

There are a lot of researches on the path planning algorithm of the unmanned vehicle. Previous researches related to the path planning mainly focused on finding the shortest path on the given map. However, on the battle field, if the vehicle just moves along the shortest path, it could not reach the goal, because of the enemy’s attack. Therefore it’s necessary that the new path planning algorithm for the unmanned vehicle on the battle field.

In this paper, we will suggest a new path planning algorithm for the vehicle on the battle field using extended A* algorithm with survivability. For this, we will define the survivability and develop the additional cost function to find the optimal path in this situation. To verify the proposed algorithm, we developed the simulation program and the results will be shown.

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. Papoulis, A., Unnikrishna Pillai, S.: Probability, Random Variables and Stochastic Processes. McGraw-Hill Higher Education (2002)

    Google Scholar 

  2. Shah, A.K.: A Simpler Approximation for Areas Under the Standard Normal Curve. The American Statistician 39(1), 80 (1985)

    Google Scholar 

  3. Hart, P.E., Nilsson, N.J., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions of Systems Science and Cybernetics ssc-4(2), 100–107 (1968)

    Article  Google Scholar 

  4. Lester, P.: A* Pathfinding for Beginners, http://www.policyalmanac.org/games/aStarTutorial.htm

  5. Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns. Addison-Wesley (1995)

    Google Scholar 

  6. Musser, D.R., Derge, C.J., Saini, A.: STL Tutorial and Reference Guide, 2nd edn. Addison-Wesley (2001)

    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

Kim, MH., Lee, HM., Wei, Y., Lee, MC. (2012). A Study of New Path Planning Algorithm Using Extended A* Algorithm with Survivability. In: Su, CY., Rakheja, S., Liu, H. (eds) Intelligent Robotics and Applications. ICIRA 2012. Lecture Notes in Computer Science(), vol 7508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33503-7_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33503-7_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33502-0

  • Online ISBN: 978-3-642-33503-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics