Dhulkefl Elaf JirjeesDurdu Akif2024-12-022024-12-0220192456-64702456 - 6470https://www.ijtsrd.com/papers/ijtsrd23696.pdfhttps://hdl.handle.net/20.500.13091/8446In this paper, the shortest path for Unmanned Aerıal 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 UAVsElektronikeninfo:eu-repo/semantics/openAccessMühendislik Temel Alanı->Elektrik-Elektronik MühendisliğiUAVPath PlanningA* AlgorithmDijkstra AlgorithmArticle