To Summarize, the factors involved in I shows better results for path planning in the single autonomous mobile robot. Each Factor is applied for each Algorithm to gain a solution which shows Genetic Algorithm is suitable for finding a Shortest Path Distance which is calculated in meters, for Obstacles Avoidance Neural Network plays a major role which is measured in Millimeters and for measuring a time in Minutes the genetic Algorithm is good for reaching a target in a few minutes compared to other techniques. Thus the required solution shown in Phase I represents Soft Computing is better for Path Planning by an autonomous Single Mobile robot. In Phase II the factors are involved in calculating path planning in Multiple Robots. The Shortest Path Distance factor is applied in Conventional and Soft computing techniques, but better result shown in Ant Colony Optimization which is a soft computing technique. In the process of finding an Obstacles, here also Ant Colony Optimization playing a major role. In the third factor, Ant colony Optimization (ACO) takes less time for reaching a target compared to other techniques. The Hybrid Algorithm is also more effective in finding a better solution like Computing method, but less complex for merging two or more Algorithm. From the Phase I and Phase II overall view Soft computing Techniques shows better results for finding a shortest path, Obstacle Avoidance and Elapsed time where Conventional Techniques also involve in finding these factors but it shows only less effective results. 5. CONCLUSION The different path planning algorithm for an autonomous mobile robot has been endured with various techniques. Each technique has its own advantages and disadvantages. Each section shows the different approaches used for Path Planning in Autonomous Mobile Robot in both Static and Dynamic Environment. This work showed complete survey on various mobile robot path planning techniques that can optimize the robot path. Simulation results justify that softcomputing algorithm especially ACO based path planning outperform traditional methods, both in the perspective of single and multi robot path planning, based on the factors such as shortest path distance, obstacle avoidance, elapsed time and high computational problems. This survey can offer better assistance in the understanding of the path planning techniques and also guide researchers to formulate novel techniques for improved path planning in both single and multi robot environments.
To Summarize, the factors involved in I shows better results for path planning in the single autonomous mobile robot. Each Factor is applied for each Algorithm to gain a solution which shows Genetic Algorithm is suitable for finding a Shortest Path Distance which is calculated in meters, for Obstacles Avoidance Neural Network plays a major role which is measured in Millimeters and for measuring a time in Minutes the genetic Algorithm is good for reaching a target in a few minutes compared to other techniques. Thus the required solution shown in Phase I represents Soft Computing is better for Path Planning by an autonomous Single Mobile robot. In Phase II the factors are involved in calculating path planning in Multiple Robots. The Shortest Path Distance factor is applied in Conventional and Soft computing techniques, but better result shown in Ant Colony Optimization which is a soft computing technique. In the process of finding an Obstacles, here also Ant Colony Optimization playing a major role. In the third factor, Ant colony Optimization (ACO) takes less time for reaching a target compared to other techniques. The Hybrid Algorithm is also more effective in finding a better solution like Computing method, but less complex for merging two or more Algorithm. From the Phase I and Phase II overall view Soft computing Techniques shows better results for finding a shortest path, Obstacle Avoidance and Elapsed time where Conventional Techniques also involve in finding these factors but it shows only less effective results. 5. CONCLUSION The different path planning algorithm for an autonomous mobile robot has been endured with various techniques. Each technique has its own advantages and disadvantages. Each section shows the different approaches used for Path Planning in Autonomous Mobile Robot in both Static and Dynamic Environment. This work showed complete survey on various mobile robot path planning techniques that can optimize the robot path. Simulation results justify that softcomputing algorithm especially ACO based path planning outperform traditional methods, both in the perspective of single and multi robot path planning, based on the factors such as shortest path distance, obstacle avoidance, elapsed time and high computational problems. This survey can offer better assistance in the understanding of the path planning techniques and also guide researchers to formulate novel techniques for improved path planning in both single and multi robot environments.
doc_20_11_2017_20_24_44.docx