Path Planning Algorithm Development Using Configuration Space Obstacles and Equidistant Paths Using AI & ML

Abstract

In this research paper, the design & development of the shortest path along with obstacle avoidance (shortest path with obstacle collision free path with avoidance) is presented using the novel approach of what is called as the configuration space method and the Equidistant Path (EP) is carried out using AI & ML concepts.  The developed models are used to construct the algorithms which could be used for simulation of the path planning problem as here we are concentrating only on the gross to plan the robot motion& not on the fine motion planned schemes. Simulation is done using the C++ programming language and the results are observed and compared with the work done by others to substantiate the proposed work so that the effectivity of the proposed algorithms are met.  Finally, conclusions are presented at the end of the paper.