Pathplanning Optimization Based on Various Soft Computing Technique: A Survey
- 1Dept. of Electronics and Telecommunication Engineering, Bhilai Institute of Technology, Bhilai House Durg, C.G., India
- 2Dept. of Electronics and Telecommunication Engineering, Bhilai Institute of Technology, Bhilai House Durg, C.G., India
Res. J. Engineering Sci., Volume 5, Issue (4), Pages 40-42, April,26 (2016)
Earlier projects are based on the single objective means they consider on single objective of that environment. Problem of path planning is basically based on two types of model that is static and dynamic. In our daily life or in war field or in many areas this can be used. The main objective of this paper is that how easily we can reach to the path or we do the designing for path finding with obstacles avoidance which can be done by different engineering tools, by soft computing techniques or by some mathematical formula. Many issues comes in path planning with obstacles avoidance like in complex environment , natural motion , moving obstacles , finding shortest path, or by producing smooth trajectories. To summarize the major technique for those readers we find that in some papers different-different search technique is used on single objective function and some papers are based on GPU or sensors.
- Jean Bosco Mbede, Xinhan Huang and Min Wang (2003)., Robust Neuro-Fuzzy sensors-based motion control among dynamic obstacles for robot manipulators., IEEE transactions on fuzzy systems, 11(2).
- Durgesh Kumar Gupta and Anant Kumar Jaiswal (2013)., Path Planning with Real Time Obstacle Avoidance., International Journal of Computer Applications, (0975 – 8887), 70(5).
- Pranab K Dan (2009)., Obstacle Avoidance and Travel Path Determination in Facility Location Planning, Jordan., Journal of Mechanical and Industrial Engineering, ISSN 1995-6665, 37-46, 3(1).
- Amir Hosseinzadeh and Habib Izadkhah (2010)., Evolutionary Approach for Mobile Robot Path Planning in Complex environment., IJCSI International Journal of Computer Science, 7(4), 8.