Skip to main content

Improved A-star Algorithm with Least Turn for Robotic Rescue Operations

  • Conference paper
  • First Online:
Computational Intelligence, Communications, and Business Analytics (CICBA 2017)

Abstract

Nowadays, the robots are widely used in many areas, where Human life cannot be compromised. In the Rescue operation, the robots need to search for the trapped humans. The A-star algorithm and it’s variations like Iterative Deepening A-star (IDA-star), Jump Point Search (JPS), etc. are the most popular algorithm in the field of Path-finding in Maze. In those rescue operations, the efficient path between the robot and the trapped person need to be found. But due to their heuristic nature, one cannot predict that whether the output of those algorithms will be cost-efficient or not. Here we are presenting a modified cost function of A-star algorithm in such a way that it will produce a path with less number of rotations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Similar content being viewed by others

References

  1. Algfoor, Z., Sunar, M., Kolivand, H.: A comprehensive study on pathfinding techniques for robotics and video games. Int. J. Comput. Games Technol. (2015). doi:10.1155/2015/736138

    Google Scholar 

  2. Dong, Z., Li, M.: A routing method of ad hoc networks based on A-star algorithm. In: International Conference on Networks Security, Wireless Communications and Trusted Computing (2009). doi:10.1109/NSWCTC.2009.21

  3. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publisher, San Francisco (2001)

    MATH  Google Scholar 

  4. Joshi, H., Shinde, J.: An image based path planning using A-star algorithm. Int. J. Emerg. Res. Manag. Technol. 3(5), 127–131 (2014)

    Google Scholar 

  5. Liu, X., Gong, D.: A comparative study of A-star algorithms for search and rescue in perfect maze. In: Electric Information and Control Engineering (ICEICE) (2011). doi:10.1109/ICEICE.2011.5777723

  6. Terzimehic, T., Silajdzic, S., Vajnberger, V., Velagic, J., Osmic, N.: Path finding simulator for mobile robot navigation. In: International Symposium on Information, Communication and Automation Technologies (2011). doi:10.1109/ICAT.2011.6102086

  7. Yao, J., Lin, C., Xie, X., Wang, A., Hung, C.: Path planning for virtual human motion using improved A* algorithm. In: Seventh International Conference on Information Technology (2010). doi:10.1109/ITNG.2010.53

  8. Zhang, Z., Zhao, Z.: A multiple mobile robots path planning algorithm based on A-star and Dijkstra algorithm. Int. J. Smart Home 8(3), 75–86 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ashok M. Chaudhari .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Chaudhari, A.M., Apsangi, M.R., Kudale, A.B. (2017). Improved A-star Algorithm with Least Turn for Robotic Rescue Operations. In: Mandal, J., Dutta, P., Mukhopadhyay, S. (eds) Computational Intelligence, Communications, and Business Analytics. CICBA 2017. Communications in Computer and Information Science, vol 776. Springer, Singapore. https://doi.org/10.1007/978-981-10-6430-2_48

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6430-2_48

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6429-6

  • Online ISBN: 978-981-10-6430-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics