Robot Path Planning using Dynamic Programming with Accelerating Nodes

Robot Path Planning using Dynamic Programming with Accelerating Nodes

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 cos...

Full description

Bibliographic Details
Main Authors: Kala Rahul, Shukla Anupam, Tiwari Ritu
Format: Article
Language:English
Published: De Gruyter 2012-03-01
Series:Paladyn
Subjects:
path planning
dynamic programming
artificial neural networks
a*
robotics
heuristics
Online Access:https://doi.org/10.2478/s13230-012-0013-4

Internet

https://doi.org/10.2478/s13230-012-0013-4

Similar Items