Skip to main content
Log in

Fast and Optimal Path Planning Algorithm (FAOPPA) for a Mobile Robot

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Motion planning problem though widely studied in robotics is a difficult problem. It finds a feasible path from an initial position to a final position in an environment with obstacles. Recent researches do not just aim to find feasible paths but to find paths that are optimal in respect to time, distance and safety of the robots. Optimization based techniques have been proposed to solve this problem but some of them used techniques that may converge to local minimum and they seldom consider the speed of the technique. Hence this paper presents a fast and global motion planning algorithm for a mobile robot in a known environment with static obstacles. It uses particle swarm optimization (PSO) technique for convergence to global minimum and a customized algorithm which generates the coordinates of the search space. The coordinate values when generated by the customized algorithm are passed to the PSO algorithm which uses them to determine the shortest path between the two given end positions. We perform our experiments using four different environments with population sizes 100, 50, 20 and 10 in a 10 × 10 grid and our results are favorable.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Bayat, F., Najafinia, S., & Aliyari, M. (2018). Mobile robots path planning: Electrostatic potential field approach. Expert Systems with Applications, 100, 68–78.

    Article  Google Scholar 

  2. Denny, J., Greco, E., Thomas, S. L., & Amato, N. M. (2014). MARRT: Medial axis biased rapidly-exploring random trees. In Proceedings of IEEE international conference of robotics automation (ICRA) (pp. 90–97). Hong Kong, China.

  3. Ekenna, C., Jacobs, S. A., Thomas, S. L., & Amato N. M. (2013). Adaptive neighbor connection for PRMs: A natural fit for heterogeneous environments and parallelism. In: Proceedings of IEEE international conference on intelligent robotics systems (IROS), Tokyo, Japan.

  4. Kim, J. J., & Lee, J. J. (2015). Trajectory optimization with particle swarm optimization for manipulator motion planning. IEEE Transactions on Industrial Informatics, 11(3), 620–631.

    Article  Google Scholar 

  5. LaValle, S. M., & Kuffner, J. J. (2001). Randomized kinodynamic planning. International Journal of Robotics Research, 20(5), 378–400.

    Article  Google Scholar 

  6. Lien, J.-M., Bayazit, O. B., Sowell, R.-T., Rodriguez, S., & Amato, N. M. (2004). Shepherding behaviors. In Proceedings of IEEE international conference on robotics and automation (ICRA) (pp. 4159–4164).

  7. Mac, T. T., Copot, C., Tran, D. T., & De Keyser, R. (2017). A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization. Applied Soft Computing, 59, 68–76.

    Article  Google Scholar 

  8. Paquet, U., & Engelbrecht, A. P. (2003). Training support vector machines with particle swarms. In Proceedings of international joint conference on neural networks (IJCNN) conference (pp. 1593–1598).

  9. Reif, J. H. (1979). Complexity of the mover’s problem and generalizations. In: Proceedings of IEEE symposium on foundations of computer science (FOCS) (pp. 421–427). San Juan, Puerto Rico.

  10. Song, G., & Amato, N. M. (2001). Using motion planning to study protein folding pathways. In Proceedings of international conference Computer Molecular Biology (RECOMB) (pp. 287–296).

  11. van den Bergh, F. (2002). An analysis of particle swarm optimizers (pp. 15–30). Ph.D. Thesis, Department of Computer Science, University of Pretoria.

  12. Venu, G. G., & Ganesh, K. V. (2003). Evolving digital circuits using particle swarm. In Proceedings of international joint conference on neural networks (IJCNN) conference (pp. 468–471).

  13. Wang, B., Li, S., Guo, J., & Chen, Q. (2018). Car-like mobile robot path planning in rough terrain using multi-objective particle swarm optimization algorithm. Neurocomputing, 282, 42–51.

    Article  Google Scholar 

  14. Zhang, Y., Chen, C., & Liu, Q. (2016). Mobile robot path planning using ant colony algorithm. International Journal of Control and Automation, 9(9), 19–28.

    Article  Google Scholar 

  15. Zhou, Z., Wang, J., Zhu, Z., Yang, D., & Wu, J. (2018). Tangent navigated robot path planning strategy using particle swarm optimized artificial potential field. Optik, 158, 639–651.

    Article  Google Scholar 

Download references

Acknowledgements

Covenant University is acknowledged for sponsoring this research.

Author information

Authors and Affiliations

Authors

Contributions

All the authors contributed immensely to this research. The paper is a product of optimization sub cluster of the Department of Mathematics, Covenant University, Ota.

Corresponding author

Correspondence to Hilary I. Okagbue.

Ethics declarations

Conflicts of interest

The authors declare no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Adamu, P.I., Okagbue, H.I. & Oguntunde, P.E. Fast and Optimal Path Planning Algorithm (FAOPPA) for a Mobile Robot. Wireless Pers Commun 106, 577–592 (2019). https://doi.org/10.1007/s11277-019-06180-w

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-019-06180-w

Keywords

Navigation