Improved Variable-Step-Length

Abstract

The use of Mobile Robots in different sectors are increasing day by day. Mobile robots are widely used in industrial sectors nowadays. In different rescue missions people use mobile robots. In order to perform better there needs to be a good path planning process for these mobile robots. A very long time ago A* search algorithm was proposed as a better way of finding a path from source to destination. But in today’s world it seems not very likely to perform that better. And for the betterment of path planning this algorithm was modified and improved in many ways. And still the research is going on. One of the research work variablestep-length A* search which can take steps of length larger than one. It produces more optimal path than A* Search. But it uses fixed step length throughout the whole process. But it is possible to get more optimal path if the step length can be changed throughout the process when necessary. So, a modified variable-step-length A* search algorithm is proposed in this research which can update or adjust step length. This algorithm can find a path with less path length.