Author:
Kala Rahul,Shukla Anupam,Tiwari Ritu
Abstract
AbstractWe solve the problem of robot path planning using Dynamic Programming (DP) designed to perform well in case of a sudden path blockage. A conventional DP algorithm works well for real time scenarios only when the update frequency is high i.e. changes can be readily propagated. In case updates are costly, for a sudden blockage the robot continues moving along the wrong path or stands stationary. We propose a modified DP that has nodes with additional processing (called accelerating nodes) to enable different segments of the map to become informed about the blockage rapidly. We further quickly compute an alternative path in case of a blockage. Experimental results verify that usage of accelerating nodes makes the robot follow optimal paths in dynamic environments.
Subject
Behavioral Neuroscience,Artificial Intelligence,Cognitive Neuroscience,Developmental Neuroscience,Human-Computer Interaction
Reference27 articles.
1. A. R. Willms, S. X. Yang, An Efficient Dynamic System for Real-Time Robot-Path Planning, IEEE Transactions on Systems Man and Cybernetics — Part B Cybernetics, 36(4) (2006), 755–766
2. S. X. Yang, M. Meng, An efficient neural network approach to dynamic robot motion planning, Neural Networks, 13(2)(2000), 143–148.
3. A. Zelinsky, Using path transforms to guide the search for findpath in 2d, International Journal of Robotic Research, 13(4)(1994), 315–325
4. D. V. Lebedev, J. J. Steil, H. J. Ritter, The dynamic wave expansion neural network model for robot motion planning in time-varying environments, Neural Networks, 18(3), 267–285.
5. A. Shukla, R. Tiwari, R. Kala, Mobile Robot Navigation Control in Moving Obstacle Environment using A* Algorithm, In Proceedings of the International Conference on Artificial Neural Networks in Engineering Vol. 18, ASME Publications, 2008, 113–120.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献