Comparative Analysis on Path Planning Algorithm’s on Mobile Robot in Image Processing
| Author(s) | : | Rama kanta choudhury, Chandra kanta Samal |
| Institution | : | Computer science, Kalinga University, New Raipur, Chatisgarh, India |
| Published In | : | Vol. 4, Issue 8 — August 2017 |
| Page No. | : | 30-37 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
This paper presents an analysis on different path planning algorithms for mobile robot in static environment. Itinvestigates three well known path panning algorithms and compared their performance on the basis of their workingparameters and the computation time to find the solution. It also finds the shortest distance for the static environment andcompared the computational distance from start to goal point at different levels for all the three algorithms. It has beentested at different shape of the image and computational time and length for all the three algorithms and verified. Imageprocessing places an important role in the field of mobile robot navigation. There are different methods are used fornavigation. In this paper, we reviewed around 23 papers are briefly described the amount of existence of the work for eachmotion planning approach. This paper includes a comparative study using C++ based approach on mobile robot withrespect to image processing. Showing how the behavior and activity of the research paper has taken a change towards thenavigation processes which controls navigation using NFT , A*and D*Lite algorithms. It has been seen that many times theresearchers use image processing technique for obstacle avoidance or it use singles from gesture control or it takes the helpof smart phone with sensor to find the obstacle to reach the destination. Finally some open areas and challenging topics arediscussed. There are many different algorithms developed for the path planning by researchers in the field of robotics, waterbased resources, navigation and internet based games. The algorithms used in this field is A*, D* Lite and NFT (neighbourfinding technique). Here we compared three algorithms and established a comparison path based approach to differentiateboth the algorithms. We used a grid search technique using A* algorithm and quad tree approach using neighbour findingtechnique algorithm and also we used a DDA algorithm to optimize the NFT based path planning approach and compared.
Rama kanta choudhury, Chandra kanta Samal, “Comparative Analysis on Path Planning Algorithm’s on Mobile Robot in Image Processing”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 8, pp. 30-37, August 2017.








