Advertisement

Real-time path planning for a robot to track a fast moving target based on improved Glasius bio-inspired neural networks

  • Mingzhi Chen
  • Daqi ZhuEmail author
Regular Paper
  • 1 Downloads

Abstract

Path planning from the initial location to reach the target location has received considerable attentions. There are still some challenges in real-time path planning for tracking a fast moving target. In the application of tracking a fast moving target, the robot must move rapidly and correctly to follow the target. It requires an algorithm that enables real-time path planning in the fast changing environment. The Glasius Bio-inspired Neural Network (GBNN) model has been reported inefficient for the real-time path planning in the fast changing environments because its dynamic performance lags behind the fast environmental changes. This study puts forward several improvements for the GBNN model to improve its dynamic performance. An alternate weight function for GBNN model is also studied. It shows that all the proposed GBNN models can be parameter-fixed when applied in a specific case. Through theoretical analysis and comparative simulations, the improved models are stable and feasible in the real-time path planning in a rapidly changing environment.

Keywords

Improved GBNN (Glasius Bio-inspired Neural Network) Real-time Path planning Fast changing environment 

Notes

References

  1. Agreev, D.A.: Neural network implementation for the optimal path problem. J. Comput. Syst. Sci. Int. 37(37), 118–125 (1998)Google Scholar
  2. Cen, Y., Song, C., Xie, N., Wang, L.: Path planning method for mobile robot based on ant colony optimization algorithm. In: 3rd IEEE Conference on Industrial Electronics and Applications, pp. 298–301. IEEE (2008)Google Scholar
  3. Chen, M., Zhu, D.: Multi-AUV cooperative hunting control with improved Glasius bio-inspired neural network. J. Navig. 1–18. (2018)  https://doi.org/10.1017/S0373463318000851
  4. Glasius, R., Komoda, A., Gielen, S.C.A.M.: Population coding in a neural net for trajectory formation. Netw. Comput. Neural Syst. 5(4), 549–563 (1994)CrossRefGoogle Scholar
  5. Glasius, R., Komoda, A., Gielen, S.C.A.M.: Neural network dynamics for path planning and obstacle avoidance. Neural Netw. 8(1), 125–133 (1995)CrossRefGoogle Scholar
  6. Glasius, R., Komoda, A., Gielen, S.C.A.M.: A biologically inspired neural net for trajectory formation and obstacle avoidance. Biol. Cybern. 74(6), 511–520 (1996)CrossRefzbMATHGoogle Scholar
  7. Hopfield, J.J., Tank, D.W.: “Neural” computation of decisions in optimization problems. Biol. Cybern. 52(3), 141–152 (1985)zbMATHGoogle Scholar
  8. Jacob, T., Schwartz, M.: Sharir: On the piano movers problem: I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers. Commun. Pure Appl. Math. 36(3), 345–398 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  9. Jen-Hui, C., Narendra, A.: An analytically tractable potential field model of free space and its application in obstacle avoidance. IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) 28(5), 729–736 (1998)CrossRefGoogle Scholar
  10. Li, Z.X., Bui, T.D.: Robot path planning using fluid model. J. Intell. Robot. Syst. 21(1), 29–50 (1998)CrossRefGoogle Scholar
  11. Nguyen, P.D.H., Recchiuto, C.T., Sgorbissa, A.: Real-time path generation and obstacle avoidance for multirotors: a novel approach. J. Intell. Robot. Syst. 89(1), 27–49 (2018)CrossRefGoogle Scholar
  12. Perez, T.L., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560–570 (1979)CrossRefGoogle Scholar
  13. Qu, H., Yang, S.X., Willms, A.R., Zhang, Y.: Real-time robot path planning based on a modified pulse-coupled neural network model. IEEE Trans. Neural Netw. 20(11), 1724–1739 (2009)CrossRefGoogle Scholar
  14. Stentz, A.: Optimal and efficient path planning for partially-known environments. In: Proceedings IEEE International Conference on Robotics and Automation, pp. 3310–3317. IEEE (1994)Google Scholar
  15. Stentz, A.: The focussed D* algorithm for real-time replanning. In: IJCAI’95 Proceedings of the 14th international joint conference on Artificial intelligence, vol. 2, pp. 1652–1659. ACM (1995)Google Scholar
  16. Tu, Jianping, Yang, Simon X.: Genetic algorithm based path planning for a mobile robot. In: Proceedings IEEE International Conference on Robotics and Automation, vol. 1, pp. 1221–1226. IEEE (2003)Google Scholar
  17. Villacorta-Atienza, J.A., Makarov, V.A.: Neural network architecture for cognitive navigation in dynamic environments. IEEE Trans. Neural Netw. Learn. Syst. 24(12), 2075–2087 (2013)CrossRefGoogle Scholar
  18. Warren, C.W.: Fast path planning using modified A* method. In: Proceeding IEEE International Conference on Robotics and Automation, pp. 662–667. IEEE (1993)Google Scholar
  19. Xia, Y., Wang, J.: A discrete-time recurrent neural network for shortest-path routing. IEEE Trans. Autom. Control 45(11), 2129–2134 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  20. Yang, S.X., Meng, M.: An efficient neural network approach to dynamic robot path planning. Neural Netw. 13(2), 143–148 (2000)CrossRefGoogle Scholar
  21. Yang, S.X., Meng, M.: Real-time collision-free path planning of a mobile robot using a neural dynamics-based approach. IEEE Trans. Neural Netw. 14(6), 1541–1552 (2003)CrossRefGoogle Scholar
  22. Zelinsky, A.: Using path transforms to guide the search for findpath in 2D. Int. J. Robot. Res. 13(4), 315–325 (1994)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Laboratory of Underwater Vehicles and Intelligent SystemsShanghai Maritime UniversityShanghaiChina

Personalised recommendations