Robot Path Planning using Dynamic Programming with Accelerating Nodes

被引：0
作者：
Kala, Rahul [1 ]
Shukla, Anupam [1 ]
Tiwari, Ritu [1 ]
机构：
[1] Soft Computing and Expert System Laboratory, Indian Institute of Information Technology and Management Gwalior, Madhya Pradesh, Gwalior
来源：
Paladyn | 2012年 / 3卷 / 01期
关键词：
artificial neural networks; A∗; dynamic programming; heuristics; path planning; robotics;
D O I：
10.2478/s13230-012-0013-4
中图分类号：
学科分类号：
摘要：
We 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. © 2012 Rahul Kala et al.
引用
收藏
页码：23 / 34
页数：11
相关论文
共 27 条
  • [1] Willms A.R., Yang S.X., An Efficient Dynamic System for Real-Time Robot-Path Planning, IEEE Transactions on Systems Man and Cybernetics-Part B Cybernetics, 36, 4, pp. 755-766, (2006)
  • [2] Yang S.X., Meng M., An efficient neural network approach to dynamic robot motion planning, Neural Networks, 13, 2, pp. 143-148, (2000)
  • [3] Zelinsky A., Using path transforms to guide the search for findpath in 2d, International Journal of Robotic Research, 13, 4, pp. 315-325, (1994)
  • [4] Lebedev D.V., Steil J.J., Ritter H.J., The dynamic wave expansion neural network model for robot motion planning in time-varying environments, Neural Networks, 18, 3, pp. 267-285
  • [5] Shukla A., Tiwari R., Kala R., Mobile Robot Navigation Control in Moving Obstacle Environment using A∗ Algorithm, Proceedings of the International Conference on Artificial Neural Networks in Engineering, 18, pp. 113-120, (2008)
  • [6] Kambhampati S., Davis L., Multiresolution path planning for mobile robots, IEEE Journal of Robotics and Automation, 2, 3, pp. 135-145, (1986)
  • [7] Hwang J.Y., Kim J.S., Lim S.S., Park K.H., A Fast Path Planning by Path Graph Optimization, IEEE Transaction on Systems, Man, and Cybernetics-Part A: Systems and Humans, 33, 1, pp. 121-128, (2003)
  • [8] Yahja A., Stentz A., Singh S., Brumitt B.L., Framed-quadtree path planning for mobile robots operating in sparse environments, Proceedings of the 1998 IEEE International Conference on Robotics and Automation, pp. 650-655, (1998)
  • [9] Urdiales C., Bantlera A., Arrebola F., Sandoval F., Multi-level path planning algorithm for autonomous robots, IEEE Electronic Letters, 34, 2, pp. 223-224, (1998)
  • [10] Kala R., Shukla A., Tiwari R., Robotic path planning in static environment using hierarchical multi-neuron heuristic search and probability based fitness, Neurocomputing, 74, 14-15, pp. 2314-2335, (2011)
123