Unmanned Aerial Vehicle Path Planning Research Articles

A* algorithm based on adaptive expansion convolution for unmanned aerial vehicle path planning

A* algorithm based on adaptive expansion convolution for unmanned aerial vehicle path planning

A new method for unmanned aerial vehicle path planning in complex environments

To solve the problems of UAV path planning, such as low search efficiency, uneven path, and inability to adapt to unknown environments, this paper proposes A double-layer optimization A* and dynamic window method for UAV path planning. Firstly, the neighboring node clip-off rule is defined to optimize the node expansion mode of the A* algorithm, and the obstacle coverage model is designed to dynamically adjust the heurizing function of the A* algorithm to improve the path search efficiency. Then, the Bresenham algorithm is adopted for collision detection and critical path nodes are extracted to significantly reduce the number of path turning points. Secondly, a new tracking index is proposed to optimize the evaluation function of the dynamic window method to make the local path fit the global path further. By detecting the dangerous distance, the dynamic adaptive method of evaluation function weight is designed to improve the fixed weight of the dynamic window method. Finally, the key turning point of optimizing the A* algorithm is taken as the temporary target point to improve the DWA algorithm, and the local part follows the global part, and the fusion of the two algorithms is realized. Simulation results show that the proposed method can significantly improve the efficiency and smoothness of mobile robot path planning, enhance the real-time obstacle avoidance and adaptive ability of unknown environments, and better meet the requirements of complex planning tasks.

Unmanned aerial vehicle path planning in a 3D environment using a hybrid algorithm

The optimal unmanned aerial vehicle (UAV) path planning using bio-inspired algorithms requires high computation and low convergence in a complex 3D environment. To solve this problem, a hybrid A*-FPA algorithm was proposed that combines the A* algorithm with a flower pollination algorithm (FPA). The main idea of this algorithm is to balance the high speed of the A* exploration ability with the FPA exploitation ability to find an optimal 3D UAV path. At first, the algorithm starts by finding the locally optimal path based on a grid map, and the result is a set of path nodes. The algorithm will select three discovered nodes and set the FPA's initial population. Finally, the FPA is applied to obtain the optimal path. The proposed algorithm's performance was compared with the A*, FPA, genetic algorithm (GA), and partical swarm optimization (PSO) algorithms, where the comparison is done based on four factors: the best path, mean path, standard deviation, and worst path length. The simulation results showed that the proposed algorithm outperformed all previously mentioned algorithms in finding the optimal path in all scenarios, significantly improving the best path length and mean path length of 79.3% and 147.8%, respectively.

Unified path planning for composite UAVs via Fermat point-based grouping particle swarm optimization

This paper is concerned with the problem of path planning for a class of composite unmanned aerial vehicles (UAVs). The composite UAV in the paper refers to an aerial vehicle consisting of a carrier UAV and several parasite UAVs to be launched, which combines the advantages of long flight range and high flexibility. A Fermat point-based grouping particle swarm optimization (FP-GPSO) algorithm is proposed to simultaneously determine the air-launch position and optimize the resulting multi-segmented paths. In the proposed approach, the particles are initialized into three groups considering the spatial distribution of the air-launch position, and one of the groups makes full use of the geometric property of the Fermat point. An update strategy of particles is then devised, in which not only the global best particle but the group-best particles are utilized to guide the other particles. By this means, as compared to conventional methods, the developed algorithm is more capable of effectively avoiding the local optimum, as such finding the optimal paths. Simulations are provided to demonstrate the superiority of FP-GPSO in path planning for composite UAVs.

UAV Track Planning Based on Improved Marine Predator Algorithm

Aiming at the optimization problem in the field of automatic control of unmanned aerial vehicles (UAVs) for track planning, this paper proposes an optimization method of UAV track planning based on improved Marine predator algorithm, adopts uniform distribution space and pseudo-reverse learning strategy to improve population initialization, and uses T distribution as disturbance factor to update position. The objective function of the improved Marine predator algorithm considering the cost of track length, terrain and flight height is established, and the simulation test is carried out on MATLAB software. The simulation results show that an optimal path to avoid obstacles and threat areas can be obtained with particle swarm optimization and snake optimization, indicating that this method has stronger robustness and feasibility in UAV path planning.

Path Planning for UAVs Under GPS Permanent Faults

Unmanned aerial vehicles (UAVs) have various applications in different settings, including e.g., surveillance, packet delivery, emergency response, data collection in the Internet of Things (IoT), and connectivity in cellular networks. However, this technology comes with many risks and challenges such as vulnerabilities to malicious cyber-physical attacks. This paper studies the problem of path planning for UAVs under GPS sensor permanent faults in a cyber-physical system (CPS) perspective. Based on studying and analyzing the CPS architecture of the UAV, the cyber “attacks and threats” are differentiated from attacks on sensors and communication components. An efficient way to address this problem is to introduce a novel approach for UAV’s path planning resilience to GPS permanent faults artificial potential field algorithm (RCA-APF). The proposed algorithm completes the three stages in a coordinated manner. In the first stage, the permanent faults on the GPS sensor of the UAV are detected, and the UAV starts to divert from its initial path planning. In the second stage, we estimated the location of the UAV under GPS permanent fault using Received Signal Strength (RSS) trilateration localization approach. In the final stage of the algorithm, we implemented the path planning of the UAV using an open-source UAV simulator. Experimental and simulation results demonstrate the performance of the algorithm and its effectiveness, resulting in efficient path planning for the UAV.

Enhanced multi-strategy bottlenose dolphin optimizer for UAVs path planning

The path planning of unmanned aerial vehicle is a complex practical optimization problem, which is an important part of unmanned aerial vehicle technology. For constrained path planning problem, the traditional path planning methods can not deal with the complex constraint conditions well, and the classical nature-inspired algorithms will find the local optimal solution due to the lack of optimization ability. In this paper, an enhanced multi-strategy bottlenose dolphin optimizer is proposed to solve the unmanned aerial vehicle path planning problem under threat environments. Firstly, the introduction of fish aggregating device strategy that simulates the living habits of sharks enriches the behavioral diversity of the population. Secondly, random mixed mutation strategy and chaotic opposition-based learning strategy expand the exploration range of the algorithm in the solution space by disturbing the positions of some individuals and generating the opposite population respectively. Finally, after balancing the exploration and exploitation ability of the algorithm more reasonably through the mutation factor and energy factor, this paper proposes a new swarm intelligence algorithm. After verifying the adaptability and efficiency of the proposed algorithm through different types of test functions, this paper further highlights the advantages of the proposed algorithm in finding the optimal feasible path in the unmanned aerial vehicle path planning model based on four constraints.

Improve exploration in deep reinforcement learning for UAV path planning using state and action entropy

Despite being a widely adopted development framework for unmanned aerial vehicle (UAV), deep reinforcement learning is often considered sample inefficient. Particularly, UAV struggles to fully explore the state and action space in environments with sparse rewards. While some exploration algorithms have been proposed to overcome the challenge of sparse rewards, they are not specifically tailored for UAV platform. Consequently, applying those algorithms to UAV path planning may lead to problems such as unstable training processes and neglect of action space comprehension, possibly causing negative impacts on the path planning results. To address the problem of sparse rewards in UAV path planning, we propose an information-theoretic exploration algorithm, Entropy Explorer (EE), specifically for UAV platform. The proposed EE generates intrinsic rewards based on state entropy and action entropy to compensate for the scarcity of extrinsic rewards. To further improve sampling efficiency, a framework integrating EE and Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithms is proposed. Finally, the TD3-EE algorithm is tested in AirSim and compared against benchmarking algorithms. The simulation outcomes manifest that TD3-EE effectively stimulates the UAV to comprehensively explore both state and action spaces, thereby attaining superior performance compared to the benchmark algorithms in the realm of path planning.

A novel state transition algorithm with adaptive fuzzy penalty for multi-constraint UAV path planning

Unmanned aerial vehicles (UAVs) require pre-planned flight paths that are energy-efficient, safe and smooth across their wide range of application scenarios. In this study, a novel UAV path planning method is proposed. Firstly, the UAV path planning under numerous obstacles is modeled as a continuous constrained optimization problem. The cost function is formulated as a linear combination of length, height variation, and smoothness, while the constraints include obstacle avoidance, height limitation, and the maneuverability of UAV. Subsequently, a novel constrained state transition algorithm with adaptive fuzzy penalty (AFSTA) is proposed to solve the optimization problem. In AFSTA, a novel adaptive fuzzy penalty function is designed to leverage expert knowledge to establish a reasonable mapping relationship from the fitness value and the degree of constraint violation to the penalty factor for a candidate solution. Meanwhile, the state transition algorithm (STA) is used as the search engine for both global and local search. Experimental results illustrate that the proposed method can find energy-efficient, safe, and maneuverable flight paths successfully with the superiority over other state-of-the-art metaheuristic algorithms.

Dynamic Scene Path Planning of UAVs Based on Deep Reinforcement Learning

Traditional unmanned aerial vehicle path planning methods focus on addressing planning issues in static scenes, struggle to balance optimality and real-time performance, and are prone to local optima. In this paper, we propose an improved deep reinforcement learning approach for UAV path planning in dynamic scenarios. Firstly, we establish a task scenario including an obstacle assessment model and model the UAV’s path planning problem using the Markov Decision Process. We translate the MDP model into the framework of reinforcement learning and design the state space, action space, and reward function while incorporating heuristic rules into the action exploration policy. Secondly, we utilize the Q function approximation of an enhanced D3QN with a prioritized experience replay mechanism and design the algorithm’s network structure based on the TensorFlow framework. Through extensive training, we obtain reinforcement learning path planning policies for both static and dynamic scenes and innovatively employ a visualized action field to analyze their planning effectiveness. Simulations demonstrate that the proposed algorithm can accomplish UAV dynamic scene path planning tasks and outperforms classical methods such as A*, RRT, and DQN in terms of planning effectiveness.

A review of unmanned aerial vehicle path planning techniques

The paper offers an exhaustive scholarly review of the algorithms and techniques employed in Unmanned Aerial Vehicle (UAV) path planning, categorizing these methodologies based on spatial dimensions, planning steps, and the nature of planning maps. It provides a critical evaluation of a plethora of algorithms, including random search methods, particle swarm algorithms, genetic algorithms, and A* algorithms, among others. The study elucidates the advantages and limitations of each algorithm, with a particular focus on their efficacy in real-time planning and navigation within complex three-dimensional environments. It underscores that while the domain of pre-flight path planning has reached a level of relative maturity, there exists a conspicuous gap in the literature concerning real-time obstacle avoidance and optimal path planning, particularly when constrained by limited computational resources. The paper thus serves as both a comprehensive review and a call for further research aimed at addressing these identified lacunae to ensure the generation of safe and feasible UAV trajectories.

Path planning method for unmanned aerial vehicles

Unmanned aerial vehicles, commonly known as drones, have seen tremendous growth and wide-spread use in the last ten years, largely because of unheard-of technological improvements. It is currently one of the most significant study subjects since it involves many different areas of robotics and control systems. This study aims to thoroughly assess the most popular approaches for unmanned aerial vehicle path planning, while also outlining their benefits, drawbacks, potential uses, and overall effectiveness. The objective is to present the academic community with a summary of the existing environment and the development direction of future unmanned aerial vehicle path planning algorithms to encourage more research for quickly evolving planning of intelligent systems.

Research on Unmanned Aerial Vehicle Path Planning

As the technology of unmanned aerial vehicles (UAVs) advances, these vehicles are increasingly being used in various industries. However, the navigation of UAVs often faces restrictions and obstacles, necessitating the implementation of path-planning algorithms to ensure safe and efficient flight. This paper presents innovative path-planning algorithms designed explicitly for UAVs and categorizes them based on algorithmic and functional levels. Moreover, it comprehensively discusses the advantages, disadvantages, application challenges, and notable outcomes of each path-planning algorithm, aiming to examine their performance thoroughly. Additionally, this paper provides insights into future research directions for UAVs, intending to assist researchers in future explorations.

Coverage Path Planning of UAV Based on Linear Programming—Fuzzy C-Means with Pigeon-Inspired Optimization

In contrast to rotorcraft, fixed-wing unmanned aerial vehicles (UAVs) encounter a unique challenge in path planning due to the necessity of accounting for the turning radius constraint. This research focuses on coverage path planning, aiming to determine optimal trajectories for fixed-wing UAVs to thoroughly explore designated areas of interest. To address this challenge, the Linear Programming—Fuzzy C-Means with Pigeon-Inspired Optimization algorithm (LP-FCMPIO) is proposed. Initially considering the turning radius constraint, a linear-programming-based model for fixed-wing UAV coverage path planning is established. Subsequently, to partition multiple areas effectively, an improved fuzzy clustering algorithm is introduced. Employing the pigeon-inspired optimization algorithm as the final step, an approximately optimal solution is sought. Simulation experiments demonstrate that the LP-FCMPIO, when compared to traditional FCM, achieves a more balanced clustering effect. Additionally, in contrast to traditional PIO, the planned flight paths display improved coverage of task areas, with an approximately 27.5% reduction in the number of large maneuvers. The experimental results provide validation for the effectiveness of the proposed algorithm.

A novel unmanned aerial vehicle path planning approach: sand cat optimization algorithm incorporating learned behaviour

Unmanned aerial vehicle (UAV) path planning plays an important role in UAV flight, and an effective algorithm is needed to realize UAV path planning. The sand cat algorithm is characterized by simple parameter setting and easy implementation. However, the convergence speed is slow, easy to fall into the local optimum. In order to solve these problems, a novel sand cat algorithm incorporating learning behaviors (LSCSO) is proposed. LSCSO is inspired by the life habits and learning ability of sand cats and incorporates a new position update strategy into the basic Sand Cat Optimization Algorithm, which maintains the diversity of the population and improves the convergence ability during the optimization process. Finally, LSCSO is applied to the challenging UAV 3D path planning with cubic B-spline interpolation to generate a smooth path, and the proposed algorithm is compared with a variety of other competing algorithms. The experimental results show that LSCSO has excellent optimization-seeking ability and plans a safe and feasible path with minimal cost consideration among all the compared algorithms.

APPA-3D: an autonomous 3D path planning algorithm for UAVs in unknown complex environments

Due to their high flexibility, low cost, and ease of handling, Unmanned Aerial Vehicles (UAVs) are often used to perform difficult tasks in complex environments. Stable and reliable path planning capability is the fundamental demand for UAVs to accomplish their flight tasks. Most researches on UAV path planning are carried out under the premise of known environmental information, and it is difficult to safely reach the target position in the face of unknown environment. Thus, an autonomous collision-free path planning algorithm for UAVs in unknown complex environments (APPA-3D) is proposed. An anti-collision control strategy is designed using the UAV collision safety envelope, which relies on the UAV's environmental awareness capability to continuously interact with external environmental information. A dynamic reward function of reinforcement learning combined with the actual flight environment is designed and an optimized reinforcement learning action exploration strategy based on the action selection probability is proposed. Then, an improved RL algorithm is used to simulate the UAV flight process in unknown environment, and the algorithm is trained by interacting with the environment, which finally realizes autonomous collision-free path planning for UAVs. The comparative experimental results in the same environment show that APPA-3D can effectively guide the UAV to plan a safe and collision-free path from the starting point to the target point in an unknown complex 3D environment.

Optimized charging-station placement and UAV trajectory for enhanced uncertain target detection in intelligent UAV tracking systems

Unmanned Aerial Vehicle (UAV) technology is proposed to improve social safety, provide specialized services, and improve overall well-being in crowded indoor spaces. The deployment of drones in indoor environments can improve emergency response time, offer various wireless services, allow efficient tracking, and improve awareness in crowded scenarios. In this paper, we propose a UAV-based tracking framework that relies on energy-limited UAVs that attempts to determine the appropriate placement of UAV charging stations (CHSs) and design a UAV path planning strategy to effectively carry out detection/tracking tasks of uncertain phenomena. The proposed framework comprises a CHS placement method and a UAV path planning algorithm. The CHS placement method attempts to find the optimal placement of a given number of available CHSs so that the energy consumed by a UAV to reach the nearest CHS is reduced. This, consequently, preserves the UAV’s energy, reducing the time required to return to the CHS and the period of none-tracking during the return time to the CHS. This can extend the tracking mission time and enhance detection performance. Based on the obtained optimal CHS placement, we design a reinforcement learning (RL)–based UAV trajectory algorithm to effectively detect and track a target (event of interest) with unknown behavior. The proposed RL-based UAV trajectory algorithm leverages long-term spatio-temporal behavior knowledge of uncertain targets (i.e., observed and learned events) to improve detection accuracy. Improving the detection of uncertain targets leads to better decision-making, faster responses, and improved security, safety, and efficiency in applications such as surveillance, defense, and search and rescue. The simulation results demonstrate the superior detection accuracy achieved by the proposed framework. Compared to a reference RL-based approach, the proposed algorithm achieves up to 65% higher detection accuracy in symmetric monitored areas and 20% increased accuracy in asymmetric monitored areas.

Enhancing UAV Path Planning Efficiency through Adam-Optimized Deep Neural Networks for Area Coverage Missions

Efficient Unmanned Aerial Vehicle (UAV) trajectory generation is crucial for successful area coverage missions, aiming to maximize coverage while minimizing resource consumption. In this research, we present a comprehensive study on optimizing UAV trajectory generation using Deep Neural Networks (DNNs) with the Adam optimization algorithm. The DNNs are trained on historical data to produce smooth and continuous trajectories, thereby reducing abrupt changes in direction and enhancing overall efficiency during the mission. To evaluate the performance of the proposed approach, we conducted experiments comparing different activation functions, namely tanh, sigmoid, and ReLU, with the Adam-optimized DNN model. The trajectories generated by each activation function were analyzed using key metrics, including Mean Squared Error (MSE), Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), and R-squared (R2) scores for both X and Y coordinates. The results of the comparative analysis revealed that the DNN model with the Adam optimizer exhibited superior performance over the other activation functions. It achieved lower MSE, MAE, and RMSE values, indicating better trajectory accuracy and smoother paths. Additionally, the R2 scores demonstrated a higher correlation between the generated trajectories and the actual trajectories, highlighting the model's ability to capture underlying patterns effectively. The findings underscore the significance of leveraging the Adam-optimized DNN approach for UAV trajectory planning, offering promising opportunities for resource optimization, increased mission success, and further advancements in autonomous aerial systems. This research contributes to the ongoing efforts in UAV path planning, optimization, and intelligent control strategies, paving the way for enhanced autonomous systems in various real-world applications.

Algorithm for UAV path planning in high obstacle density environments: RFA-star.

Path planning is one of the key elements for achieving rapid and stable flight when unmanned aerial vehicles (UAVs) are conducting monitoring and inspection tasks at ultra-low altitudes or in orchard environments. It involves finding the optimal and safe route between a given starting point and a target point. Achieving rapid and stable flight in complex environments is paramount. In environments characterized by high-density obstacles, the stability of UAVs remains a focal point in the research of path planning algorithms. This study, utilizing a feature attention mechanism, systematically identifies distinctive points on the obstacles, leading to the development of the RFA-Star (R5DOS Feature Attention A-star) path planning algorithm. In MATLAB, random maps were generated to assess the performance of the RFA-Star algorithm. The analysis focused on evaluating the effectiveness of the RFA-Star algorithm under varying obstacle density conditions and different map sizes. Additionally, comparative analyses juxtaposed the performance of the RFA-Star algorithm against three other algorithms. Experimental results indicate that the RFA-Star algorithm demonstrates the shortest computation time, approximately 84%-94% faster than the RJA-Star algorithm and 51%-96% faster than the Improved A-Star. The flight distance is comparable to the RJA-Star algorithm, with slightly more searched nodes. Considering these factors collectively, the RFA-Star algorithm exhibits a relatively superior balance between computational efficiency and path quality. It consistently demonstrates efficient and stable performance across diverse complex environments. However, for comprehensive performance enhancement, further optimization is necessary.

Path Planning Approaches for Unmanned Aerial Vehicle

The difficulty of finding the ideal path from the starting point to the destination site for a UAV is one of the most essential challenges related with the deployment of unmanned aerial vehicle (UAV). Path planning algorithms are classified into traditional and intelligent algorithms in this article based on the order of discovery of the path planning methods. Intelligent algorithms are algorithms that are inspired by nature and can efficiently tackle the complex path planning problem. In this article, by introducing the different advantages of traditional algorithms and intelligent algorithms, it proposes employing intelligent algorithms to address the inefficiencies of traditional algorithms in uncertain conditions. The essay also outlines three classical intelligent algorithms and proposes optimization algorithms for their respective deficiencies. The article also discusses the objectives and constraints of UAV path planning. This analysis will help define the outcomes of UAV path planning and suggest the future research directions.