A hybrid approach of virtual force and A^∗ search algorithm for UAV path re-planning

Abstract

This article is concerned with the UAV path replanning problem to be solved by using a novel approach based on the hybrid of virtual force and A* search algorithm (HVFA). The formulation of the UAV path re-planning is presented, and the hybrid system model of virtual force (VF) is given. The scheme of path re-planning is designed and the corresponding computational complexity is analyzed quantitatively. Simulation results prove the feasibility and usefulness of using HVFA for UAV path re-planning. Performance comparisons between the HVFA method and the fuzzy virtual force (FVF) method demonstrate that the proposed approach is fast enough to meet the real-time requirements of the online path planning problems.

Global path planning for omnidirectional vehicles based on Bezier curve and dynamic constraints

“…Its advantage is omitting a large number of invalid results and improving the efficiency of Figure 3. The MAKLINK graph searching [13]. The cost function of A* algorithm can be expressed as follow:…”

A New Path Planning Algorithm Using a GNSS Localization Error Map for UAVs in an Urban Area

“…This path planning method is well-known as the Dijkstra algorithm [11]. By further utilizing the heuristic searching process, the A* algorithm was developed and achieved higher efficiency compared to the Dijkstra algorithm [12][13][14][15]. The A* method has been applied in an urban area, avoiding the problem of quadcopters crashing into buildings by constructing constraints of obstacles [16].…”

Autonomous route planning for UAV when threats are uncertain

“…Nowadays, most of route planning algorithm is based on the certain and static environment such as Dijkstra [1] algorithm and A* algorithm [2][3] . With the development of the air-defense system and the transformation of combat thinking, the autonomous route planning is imperative.…”