Nothing Special   »   [go: up one dir, main page]

Skip to main content

An Optimized Path Planning for the Mobile Robot Using Potential Field Method and PSO Algorithm

  • Conference paper
  • First Online:
Soft Computing for Problem Solving

Abstract

The main aim of any path/motion planning algorithm in the context of a mobile robot is to produce a collision-/crash-free path among the goal and start points in an environment in which it is present. The past few decades have seen the development of various methodologies to design an optimal path. The present research focuses on the development of an optimized path planning algorithm for the robot using a hybrid method after combining particle swarm optimization (PSO) algorithm with potential field method for static obstacles and potential field method (PFM) prediction for dynamic obstacles. While implementing, PSO-based potential field method, the total potential, that is the sum of repulsive and attractive potentials, is considered as the fitness function which is optimized using PSO algorithm. Further, a 3-point method has been used for smoothing the obtained path. Once the image of the scene is obtained, a clustering method is employed to find the center of obstacle and the location of the robot has been determined by calculating the repulsive potential in each iteration. Finally, the developed algorithms are tested on both the static and dynamic environments in computer simulations and found satisfactory.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MathSciNet  Google Scholar 

  2. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. SSC4 4(2), 100–107 (1968)

    Article  Google Scholar 

  3. Anthony, S.: Optimal and efficient path planning for partially-known environments. In: Proceedings of the International Conference on Robotics and Automation, pp. 3310–3317 (1994)

    Google Scholar 

  4. Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell. J. 155(1–2), 93–146 (2004)

    Article  MathSciNet  Google Scholar 

  5. LaValle, S.M.: Rapidly-exploring random trees: a new tool for path planning. Technical Report, Computer Science Department, Iowa State University, 98-11 (1998)

    Google Scholar 

  6. Nasrollahy, A.Z., Javadi, H.H.S.: Using particle swarm optimization for robot path planning in dynamic environments with moving obstacles and target. In: 2009 Third UKSim European Symposium on Computer Modeling and Simulation (2009)

    Google Scholar 

  7. Weerakoon, T., Ishii, K., Nassiraei, A.A.F.: An artificial potential field based mobile robot navigation method to prevent from deadlock. JAISCR 5(3), 189–203 (2015)

    Google Scholar 

  8. Montiel, O., Orozco-Rosas, U., Sepúlveda, R.: Path planning for mobile robots using Bacterial Potential Field for avoiding static and dynamic obstacles. Expert Syst. Appl. 42, 5177–5191 (2015)

    Article  Google Scholar 

  9. Han, J., Seo, Y.: Mobile robot path planning with surrounding point set and path improvement. Appl. Soft Comput. 57, 35–47 (2017)

    Article  Google Scholar 

  10. Kovács, B., Szayer, G., Tajti, F., Burdelis, M., Korondi, P.: A novel potential field method for path planning of mobile robots by adapting animal motion attributes. Robot. Auton. Syst. 82, 24–34 (2016)

    Article  Google Scholar 

  11. Bakdi, A., Hentout, A., Boutami, H., Maoudj, A., Hachour, O., Bouzouiaa, B.: Optimal path planning and execution for mobile robots using genetic algorithm and adaptive fuzzy-logic control. Robot. Auton. Syst. 89, 95–109 (2017)

    Article  Google Scholar 

  12. Pandey, A., Parhi, D.R.: Optimum path planning of mobile robot in unknown static and dynamic environments using fuzzy-wind driven optimization algorithm. Def. Technol. 13, 47–58 (2017)

    Article  Google Scholar 

  13. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ravi Kumar Mandava .

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

Mandava, R.K., Bondada, S., Vundavilli, P.R. (2019). An Optimized Path Planning for the Mobile Robot Using Potential Field Method and PSO Algorithm. In: Bansal, J., Das, K., Nagar, A., Deep, K., Ojha, A. (eds) Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 817. Springer, Singapore. https://doi.org/10.1007/978-981-13-1595-4_11

Download citation

Publish with us

Policies and ethics