Optimal Path Planning for Aerial Robots Using Genetic Algorithm

This thesis presents a path optimization solution for a robot in two different constrained 3-dimensional (3D) environments. The robot is required to travel from its current position to a goal position following minimum cost paths (optimal paths). The first environment has 3D obstacles that interfere with the robot’s path. The path cost for this environment accounts for the minimum distance traveled by the robot from the start to the goal position while avoiding obstacles. The second environment is the atmosphere of Venus, specifically a flyable region of this atmosphere with characteristics similar to Earth’s. This environment has strong westward winds that require a more complex cost function. The path cost also accounts for energy expenditure, such as thrust or drag, and energy accumulation, such as charging using the robot’s solar panels and gains of potential energy (e.g., due to upward directional winds). In this case, we can add to the path cost function the localization cost of the robot. Localization is simulated in the environment by the use of cameras pointing to the surface of the planet, with yields lower localization error when the vehicle is close to the surface. The approach proposed in this paper uses genetic algorithms, a heuristic search that, based on a population of initially feasible paths and a set of biologically inspired operations, finds a low-cost path. Path feasibility is assured by computing local reachability regions based on different factors such as wind velocity, obstacles, and the maximum speed of the robot. The method is illustrated through a series of simulations that show our results as a function of the number of iterations and path population sizes. Finally, a comparison with different planners is made in order to show that the genetic algorithms allow for more efficient and easier implementations

Survey of Robot 3D Path Planning Algorithms

Robot 3D (three-dimension) path planning targets for finding an optimal and collision-free path in a 3D workspace while taking into account kinematic constraints (including geometric, physical, and temporal constraints). The purpose of path planning, unlike motion planning which must be taken into consideration of dynamics, is to find a kinematically optimal path with the least time as well as model the environment completely. We discuss the fundamentals of these most successful robot 3D path planning algorithms which have been developed in recent years and concentrate on universally applicable algorithms which can be implemented in aerial robots, ground robots, and underwater robots. This paper classifies all the methods into five categories based on their exploring mechanisms and proposes a category, called multifusion based algorithms. For all these algorithms, they are analyzed from a time efficiency and implementable area perspective. Furthermore a comprehensive applicable analysis for each kind of method is presented after considering their merits and weaknesses