UAV Path Planning for Civil Applications

Abstract

We will present a simple and efficient algorithm for solving the path planning problem for civil UAV operating in a dynamic or incomplete environment. This algorithm searches for a continuous waypoints sequence starting from the initial configuration, visiting all the desired locations and reaching the final position. We will present our proposed algorithm on two steps: The first produces a sorted location set. The second step generates an optimal path for the overall mission. The same algorithm constructs the initial path or re-plans a new one when changes occur to the configuration space. To prove the effectiveness of our proposed algorithm, we will provide computer simulations. A comparison of many results will show that this algorithm yields good experience performance over a wide variety of examples.

Time-Optimal Path Planning of a Hybrid Autonomous Underwater Vehicle Based on Ocean Current Neural Point Grid

“…Path planning algorithms are now widely used in the civilian and military fields. The civil applications of path planning algorithms include robotic transportation and distribution [1], the automatic driving of civilian UAVs [2,3], intelligent robotic obstacle avoidance planning [4], etc. In addition, the path planning method has also been used in military-related projects, including military UAV formation planning, missile trajectory planning [5], underwater vehicle trajectory tracking [6], etc.…”