Comparative Analysis of UAV Path Planning Algorithms for Efficient Navigation in Urban 3D Environments

• URL: http://arxiv.org/abs/2508.16515v2
• Date: Tue, 26 Aug 2025 08:33:38 GMT
• Title: Comparative Analysis of UAV Path Planning Algorithms for Efficient Navigation in Urban 3D Environments
• Abstract summary: This paper conducts extensive experiments in 3D urban city environments cluttered with obstacles.<n>Three widely used algorithms, namely A*, RRT*, and Particle Swarm Optimization (PSO), are tested.<n>According to the experimental results, the A* algorithm outperforms the others in both efficiency and path quality.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The most crucial challenges for UAVs are planning paths and avoiding obstacles in their way. In recent years, a wide variety of path-planning algorithms have been developed. These algorithms have successfully solved path-planning problems; however, they suffer from multiple challenges and limitations. To test the effectiveness and efficiency of three widely used algorithms, namely A*, RRT*, and Particle Swarm Optimization (PSO), this paper conducts extensive experiments in 3D urban city environments cluttered with obstacles. Three experiments were designed with two scenarios each to test the aforementioned algorithms. These experiments consider different city map sizes, different altitudes, and varying obstacle densities and sizes in the environment. According to the experimental results, the A* algorithm outperforms the others in both computation efficiency and path quality. PSO is especially suitable for tight turns and dense environments, and RRT* offers a balance and works well across all experiments due to its randomized approach to finding solutions.

Related papers

• NaviFormer: A Deep Reinforcement Learning Transformer-like Model to Holistically Solve the Navigation Problem [53.70554593151033]
  NaviFormer is a deep reinforcement learning model that solves the global navigation problem by predicting both high-level routes and low-level trajectories.<n>Results show competitive accuracy from NaviFormer since it can understand the constraints and difficulties of each subproblem.<n>Its superior computation speed proves its suitability for real-time missions.
  arXiv  Detail & Related papers  (2026-04-18T11:32:34Z)
• Enhanced UAV Path Planning Using the Tangent Intersection Guidance (TIG) Algorithm [0.0]
  Tangent Intersection Guidance (TIG) is an advanced approach for UAV path planning in both static and dynamic environments.<n>It generates two sub-paths for each threat, selects the optimal route based on an algorithm rule, and iteratively refines the path until the target is reached.<n>TIG demonstrates efficient real-time path planning capabilities for collision avoidance, outperforming APF and Dynamic APPATT algorithms.
  arXiv  Detail & Related papers  (2025-08-26T12:11:59Z)
• Comparison of Path Planning Algorithms for Autonomous Vehicle Navigation Using Satellite and Airborne LiDAR Data [2.979579757819132]
  This work provides a comparative evaluation of mainstream and well-established path planning algorithms.<n>For 2D road-map navigation, A*, Dijkstra, RRT*, and NIACO are tested on the DeepGlobe satellite dataset.<n>For 3D road-map path planning, 3D A*, 3D Dijkstra, RRT-Connect, and NIACO are evaluated using the Hamilton airborne LiDAR dataset.
  arXiv  Detail & Related papers  (2025-07-08T11:15:21Z)
• Path Planning in a dynamic environment using Spherical Particle Swarm Optimization [0.0]
  A Dynamic Path Planner (DPP) for UAV using the Spherical Vector-based Particle Swarm optimisation technique is proposed in this study. The path is constructed as a set of way-points that stands as re-planning checkpoints. Path length, Safety, Attitude and Path Smoothness are all taken into account upon deciding how an optimal path should be. Four test scenarios are carried out using real digital elevation models. Each test gives different priorities to path length and safety, in order to show how well the SPSO-DPP is capable of generating a safe yet efficient path segments.
  arXiv  Detail & Related papers  (2024-03-19T13:56:34Z)
• POA: Passable Obstacles Aware Path-planning Algorithm for Navigation of a Two-wheeled Robot in Highly Cluttered Environments [53.41594627336511]
  Passable Obstacles Aware (POA) planner is a novel navigation method for two-wheeled robots in a cluttered environment. Our algorithm allows two-wheeled robots to find a path through passable obstacles.
  arXiv  Detail & Related papers  (2023-07-16T19:44:27Z)
• Autonomous search of real-life environments combining dynamical system-based path planning and unsupervised learning [0.0]
  This study develops a novel applied framework for real-world applications of chaotic coverage path planners.<n>It provides techniques for effective obstacle avoidance, chaotic trajectory dispersal, and accurate real-time coverage calculation.<n>The performance of this application was comparable to that of a conventional optimal path planner.
  arXiv  Detail & Related papers  (2023-05-03T00:09:31Z)
• Trajectory Design for UAV-Based Internet-of-Things Data Collection: A Deep Reinforcement Learning Approach [93.67588414950656]
  In this paper, we investigate an unmanned aerial vehicle (UAV)-assisted Internet-of-Things (IoT) system in a 3D environment. We present a TD3-based trajectory design for completion time minimization (TD3-TDCTM) algorithm. Our simulation results show the superiority of the proposed TD3-TDCTM algorithm over three conventional non-learning based baseline methods.
  arXiv  Detail & Related papers  (2021-07-23T03:33:29Z)
• An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem [49.04543375851723]
  Vehicle routing problem (VRP) is a typical discrete optimization problem. Many studies consider learning-based optimization algorithms to solve VRP. This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.
  arXiv  Detail & Related papers  (2021-07-15T02:13:03Z)
• Waypoint Planning Networks [66.72790309889432]
  We propose a hybrid algorithm based on LSTMs with a local kernel - a classic algorithm such as A*, and a global kernel using a learned algorithm. We compare WPN against A*, as well as related works including motion planning networks (MPNet) and value networks (VIN) It is shown that WPN's search space is considerably less than A*, while being able to generate near optimal results.
  arXiv  Detail & Related papers  (2021-05-01T18:02:01Z)
• Towards Optimally Efficient Tree Search with Deep Learning [76.64632985696237]
  This paper investigates the classical integer least-squares problem which estimates signals integer from linear models. The problem is NP-hard and often arises in diverse applications such as signal processing, bioinformatics, communications and machine learning. We propose a general hyper-accelerated tree search (HATS) algorithm by employing a deep neural network to estimate the optimal estimation for the underlying simplified memory-bounded A* algorithm.
  arXiv  Detail & Related papers  (2021-01-07T08:00:02Z)
• Congestion-aware Evacuation Routing using Augmented Reality Devices [96.68280427555808]
  We present a congestion-aware routing solution for indoor evacuation, which produces real-time individual-customized evacuation routes among multiple destinations. A population density map, obtained on-the-fly by aggregating locations of evacuees from user-end Augmented Reality (AR) devices, is used to model the congestion distribution inside a building.
  arXiv  Detail & Related papers  (2020-04-25T22:54:35Z)
• Bypassing or flying above the obstacles? A novel multi-objective UAV path planning problem [0.0]
  This study proposes a novel integer programming model for a collision-free discrete drone path planning problem. Considering the possibility of bypassing obstacles or flying above them, this study aims to minimize the path length, energy consumption, and maximum path risk simultaneously.
  arXiv  Detail & Related papers  (2020-04-12T13:42:05Z)
• Three Dimensional Route Planning for Multiple Unmanned Aerial Vehicles using Salp Swarm Algorithm [0.0]
  Route planning is a series of translation and rotational steps from a given start location to the destination goal location. The proposed approach improves the average cost and overall time by 1.25% and 6.035% respectively.
  arXiv  Detail & Related papers  (2019-11-24T12:36:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.