Challenging of path planning algorithms for autonomous robot in known environment

Abstract

When we do not have information of the environment, we called it unknown path planning. This paper shows the differentiable path planning methods and approaches of the algorithms in unknown environment and to understand on how the algorithms implemented in the unknown environment with some kinds of obstacles. The suitable implementation of methods and algorithms for the path planning are important for the autonomous robot to complete the path smoothly. We had done some reviews of individual paper to find the best method and algorithm in the path planning for the autonomous robot. From the reviews between the individual papers, we obtained that some algorithms are suitable for some cases in unknown environment. The evolution of D* algorithms give interesting and challenging methods in unknown environment especially in terms of speed up find the shortest path and when discover the new obstacle. 

Comprehensive study of skid-steer wheeled mobile robots: development and challenges

“…Different path planning algorithms can be divided into local and global path planners. The path planning is dynamic or local when the path is continually recalculated as more information is available and contains changing object such as moving obstacles, whereas static or global path planning refers to pathfinding based on prior information in an environment with static obstacles (Lim et al , 1997; Marin-Plaza et al , 2018; Farah et al , 2014).…”

Modified Virtual Semi-Circle Approach for a Reactive Collision Avoidance of a Mobile Robot in an Outdoor Environment

“…UGV is a vehicle that operates while in contact with the ground and without human presence on board. UGV can be an autonomous vehicle which is capable to sense their environment on its own or can either be remote-guided vehicle [1]. UGV is widely use in military and industry purposes to facilitate human task especially in surveillance issues [2].…”