Path Planning Algorithms for Unmanned Aerial Vehicles

摘要

In this paper, the shortest path for Unmanned Aeral Vehicles (UAVs) is calculated with two -dimensional (2D) path planning algorithms in the environment including obstacles and thus the robots could perform their tasks as soon as possible in the environment. The aim of this paper is to avoid obstacles and to find the shortest way to the target point. Th e simulation environment was created to evaluate the arrival time on the path planning algorithms (A* and Dijkstra algorithms) for the UAVs. As a result, real-time tests were performed with UAVs