With the advancement of technology and the rise of the unmanned aerial vehicle industry, the use of drones has grown tremendously. For drones performing near-ground delivery missions, the problem of 3D space-based path planning is particularly important in the autonomous navigation of drones in complex spaces. Therefore, an improved butterfly optimization (BOA-TSAR) algorithm is proposed in this paper to achieve the autonomous pathfinding of drones in 3D space. First, this paper improves the randomness strategy of the initial population generation in the butterfly optimization algorithm (BOA) via the Tent chaotic mapping method, by means of the removal of the short-period property, which balances the equilibrium of the initial solutions generated by the BOA algorithm in the solution space. Secondly, this paper improves the shortcomings of the BOA algorithm in terms of slower convergence, lower accuracy, and the existence of local optimal stagnation when dealing with high-dimensional complex functions via adaptive nonlinear inertia weights, a simulated annealing strategy, and stochasticity mutation with global adaptive features. Finally, this paper proposes an initial population generation strategy, based on the 3D line of sight (LOS) detection method, to further reduce the generation of path interruption points while ensuring the diversity of feasible solutions generated by the BOA algorithm for paths. In this paper, we verify the superior performance of BOA-TSAR by means of simulation experiments. The simulation results show that BOA-TSAR is very competitive among swarm intelligence (SI) algorithms of the same type. At the same time, the BOA-TSAR algorithm achieves the optimal path length measure and smoothness measure in the path-planning experiment.
The Jump Point Search (JPS) algorithm ignores the possibility of any-angle walking, so the paths found by the JPS algorithm under the discrete grid map still have a gap with the real paths. To address the above problems, this paper improves the path optimization strategy of the JPS algorithm by combining the viewable angle of the Angle-Propagation Theta* (AP Theta*) algorithm, and it proposes the AP-JPS algorithm based on an any-angle pathfinding strategy. First, based on the JPS algorithm, this paper proposes a vision triangle judgment method to optimize the generated path by selecting the successor search point. Secondly, the idea of the node viewable angle in the AP Theta* algorithm is introduced to modify the line of sight (LOS) reachability detection between two nodes. Finally, the paths are optimized using a seventh-order polynomial based on minimum snap, so that the AP-JPS algorithm generates paths that better match the actual robot motion. The feasibility and effectiveness of this method are proved by simulation experiments and comparison with other algorithms. The results show that the path planning algorithm in this paper obtains paths with good smoothness in environments with different obstacle densities and different map sizes. In the algorithm comparison experiments, it can be seen that the AP-JPS algorithm reduces the path by 1.61–4.68% and the total turning angle of the path by 58.71–84.67% compared with the JPS algorithm. The AP-JPS algorithm reduces the computing time by 98.59–99.22% compared with the AP-Theta* algorithm.
As various fields and industries have progressed, the use of drones has grown tremendously. The problem of path planning for drones flying at low altitude in urban as well as mountainous areas will be crucial for drones performing search-and-rescue missions. In this paper, we propose a convergent approach to ensure autonomous collision-free path planning for drones in the presence of both static obstacles and dynamic threats. Firstly, this paper extends the jump point search algorithm (JPS) in three dimensions for the drone to generate collision-free paths based on static environments. Next, a parent node transfer law is proposed and used to implement the JPS algorithm for any-angle path planning, which further shortens the planning path of the drones. Furthermore, the optimized paths are smoothed by seventh-order polynomial interpolation based on minimum snap to ensure the continuity at the path nodes. Finally, this paper improves the artificial potential field (APF) method by a virtual gravitational field and 3D Bresenham’s line algorithm to achieve the autonomous obstacle avoidance of drones in a dynamic-threat conflict environment. In this paper, the performance of this convergent approach is verified by simulation experiments. The simulation results show that the proposed approach can effectively solve the path planning and autonomous-obstacle-avoidance problems of drones in low-altitude flight missions.
The Theta* algorithm is a path planning algorithm based on graph search, which gives the optimal path with more flexibility than A* algorithm in terms of routes. The traditional Theta* algorithm is difficult to take into account with the global and details in path planning and traverses more nodes, which leads to a large amount of computation and is not suitable for path planning in large scenarios directly by the Theta* algorithm. To address this problem, this paper proposes an improved Theta* algorithm, namely the W-Theta* algorithm. The heuristic function of Theta* is improved by introducing a weighting strategy, while the default Euclidean distance calculation formula of Theta* is changed to a diagonal distance calculation formula, which finally achieves a reduction in computation time while ensuring a shorter global path; the trajectory optimization is achieved by curve fitting of the generated path points to make the motion trajectory of the mobile robot smoother. Simulation results show that the improved algorithm can quickly plan paths in large scenarios. Compared with other path planning algorithms, the algorithm has better performance in terms of time and computational cost. In different scenarios, the W-Theta* algorithm reduces the computation time of path planning by 81.65% compared with the Theta* algorithm and 79.59% compared with the A* algorithm; the W-Theta* algorithm reduces the memory occupation during computation by 44.31% compared with the Theta* algorithm and 29.33% compared with the A* algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.