Skip to main content

Genetic Algorithm Approach for Obstacle Avoidance and Path Optimization of Mobile Robot

  • Conference paper
  • First Online:
Computing, Communication and Signal Processing

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 810))

Abstract

The path planning is an important issue of mobile robots. Its task is to find a collision free path from the start position to the target position with an algorithm which requires less time and minimum path distance. The scheduling and planning is NP-Hard (NP-Complete) problem. Autonomous robot vehicles can be used in variety of applications including space exploration, household and transportation. In known static environment path planning algorithms such as Sub Goal network, A* algorithm, D* Star algorithm, Artificial Potential Method are used. These are classical and heuristic search based algorithms. The above mentioned algorithms have some drawbacks such as local minima, deadlock of robot, and oscillation of robot. We have proposed an algorithm which will overcome these drawbacks present in existing classical algorithms.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Li, H., Yang, S.X., Seto, M.L.: Neural-Network based path planning for a multi-robot system with moving Obstacles. In: IEEE transactions on Systems and Cybernetics Part C: Application and Reviews, vol. 39, no. 4, July 2009

    Article  Google Scholar 

  2. Li, G., Yamashita, A., Asama, H., Tamura, Y.: An Efficient Artificial Potential Field Based Regression Search Method for Robot Path Planning

    Google Scholar 

  3. Chia, S.-H., Su Jr., K.-L., Guo, H., Chung, C.-Y.: Ant colony system based mobile robot path planning. In: 2010 Fourth International Conference on Genetic and Evolutionary Computing (2010)

    Google Scholar 

  4. Bassil, Y.: Neural network model for path _planning of robotic rover. Int. J. Sci. Technol. (2012)

    Google Scholar 

  5. Duchon, F., Babinec, A., Kajan, M., Beno, P., Florek, M., Fico, T., Jurisica, L.: Path planning with modified A* Algorithm for a mobile robot. Model. Mech. Mechatron. Syst. MMaMS (2014)

    Google Scholar 

  6. Glasius, R., Komoda, A., Gielen, S.C.A.M.: Neural network dynamics for path planning and obstacle avoidance. Neural Netw. 8(1),125–133,195

    Article  Google Scholar 

  7. Guldner, J.: Autonomous Navigation System for a Mobile Robot or Manipulator United States Patent, Patent Number: 5,758,298

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sunil B. Mane .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mane, S.B., Vhanale, S. (2019). Genetic Algorithm Approach for Obstacle Avoidance and Path Optimization of Mobile Robot. In: Iyer, B., Nalbalwar, S., Pathak, N. (eds) Computing, Communication and Signal Processing . Advances in Intelligent Systems and Computing, vol 810. Springer, Singapore. https://doi.org/10.1007/978-981-13-1513-8_66

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-1513-8_66

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-1512-1

  • Online ISBN: 978-981-13-1513-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics