Skip to main content

An Improved PBIL Algorithm for Path Planning Problem of Mobile Robots

  • Conference paper
Intelligent Data Engineering and Automated Learning – IDEAL 2013 (IDEAL 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8206))

Abstract

The path planning problem of mobile robots is a NP-Hard problem often solved by evolutionary approaches such as Genetic Algorithm (GA) and Ant Colony Optimization (ACO). However, the algorithm’s performance is often influenced heavily by the determination of the operators and the choice of related parameters. In this paper, a permutation code PBIL is proposed to solve the path planning problem. First, a free space model of the mobile robot is constructed by the MAKLINK graph; second, a sub-optimal path is generated by the Dijkstra algorithm; then global optimal path is constructed by the permutation code PBIL based on the sub-optimal path. Simulation results show that the PBIL can get satisfied solutions more simply and efficiently with fewer operators and parameters.

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. Raja, P., Pugazhenthi, S.: Optimal path planning of mobile robots: A review. International Journal of Physical Sciences 7(9), 1314–1320 (2012)

    Google Scholar 

  2. Arambula, F., Padilla, M.: Autonomous Robot Navigation Using Adaptive Potential Fields. Mathematical and Computer Modeling 40, 1141–1156 (2004)

    Article  MATH  Google Scholar 

  3. Roh, S.G., Park, K.H., Yang, K.W.: Development of Dynamically Reconfigurable Personal Robot. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 4023–4028 (2004)

    Google Scholar 

  4. Payton, D.W., Rosenblatt, J.K., Keirsey, D.: Grid-based mapping for autonomous mobile robot. Robot. Auton. Syst. 11(1), 13–21 (1993)

    Article  Google Scholar 

  5. Hu, Y., Yang, S.X.: A Knowledge Based Genetic Algorithm for Path Planning of Mobile Robot. In: IEEE Int. Conf. on Robotics and Automation, vol. 5, pp. 4350–4355 (2004)

    Google Scholar 

  6. Goldberg, D.E.: Genetic Algorithms in Search,Optimization and Machine Learning. Addison-Wesley Longman publishing Co., Inc., Boston (1989)

    MATH  Google Scholar 

  7. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press/Bradford Books, Cambridge (2004)

    Book  MATH  Google Scholar 

  8. Sun, S., Lin, M.: Path Planning of multi-mobile robots using genetic algorithms. Acta Automatica Sinica 5(26), 672–676 (2000)

    Google Scholar 

  9. Nagib, G., Gharieb, W.: Path planning for a mobile robot using genetic algorithms. In: Proceedings of the International Conference on Electrical, Electronic and Computer Engineering (ICEEC 2004), pp. 185–189 (2004)

    Google Scholar 

  10. AL-Taharwa, I., Sheta, A., Al-Weshah, M.: A Mobile Robot Path Planning Using Genetic Algorithm in Static Environment. Journal of Computer Science 4(4), 341–344 (2008)

    Article  Google Scholar 

  11. Tan, G., He, H.: Ant Colony System Algorithm for Real-Time Globally Optimal Path Planning of Mobile Robots. Acta Automatica Sinica 33(3), 279–285 (2007)

    Article  MATH  Google Scholar 

  12. Zhou, J., Dai, G., He, D.Q., Ma, J., Cai, X.-Y.: Swarm Intelligence: Ant-based Robot Path Planning. In: Fifth International Conference on Information Assurance and Security, pp. 459–463 (2009)

    Google Scholar 

  13. Buniyamin, N., Sariff, N., Wan Ngah, W.A.J., Mohamad, Z.: Robot global path planning overview and a variation of ant colony system algorithm. International Journal of Mathematics and Computers in Simulation 5(1), 9–16 (2011)

    Google Scholar 

  14. Baluja, S.: Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning, Carnegie Mellon University, Technical Report CMU-CS-94-163 (1994)

    Google Scholar 

  15. Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers (2002)

    Google Scholar 

  16. Wang, Z., Zhang, Q., Ma, Y., Zhang, J., Liu, Y.: An Improved PBIL Algorithm for the Machine-Part Cell Formation. Applied Mechanics and Materials(26 - 28), 498–501 (2010)

    Google Scholar 

  17. Sariff, N., Buniyamin, N.: An overview of autonomous mobile robot path planning algorithms. In: 4th Student Conference on Research and Development, pp. 183–188 (2006)

    Google Scholar 

  18. Li, M.: Modeling and Path Planning of Mobile Robot. Yanshan University (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Q., Cai, M., Zhou, F., Nie, H. (2013). An Improved PBIL Algorithm for Path Planning Problem of Mobile Robots. In: Yin, H., et al. Intelligent Data Engineering and Automated Learning – IDEAL 2013. IDEAL 2013. Lecture Notes in Computer Science, vol 8206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41278-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41278-3_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41277-6

  • Online ISBN: 978-3-642-41278-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics