Path planning algorithm in complex environment: a survey

Path finding algorithm is a very challenging problem for navigating autonomous virtual robots in complex environment. A reliable navigation system must be able to identify the virtual robot current location, avoid any collisions and determine the smooth path trajectory of the object. At present, the needs to produce systematic and efficient path finding algorithm with impressive collision scheme has led number of researchers to conduct various experiments to improve and modify the existing algorithms in order to solve several issues in path planning algorithm with collision avoidance for autonomous virtual robot. This paper presents series of path planning algorithms for the last 10 years in order to solve the navigation of autonomous virtual robot in complex environment. We believe that all algorithms reviewed in this paper will give researchers in the field of virtual environment, collision detection and robotic about some fundamental background, issues and challenges on how navigation procedures of autonomous virtual robot in such a complex environment works