Abstract
The development of autonomous Unmanned Aerial Vehicles (UAVs) is a priority to many civilian and military organizations. Real time optimal trajectory planning is an essential element for the autonomy of UAVs. The use of metaheuristic algorithms for solving such complex optimization problems with non-linearity and multimodality has gained popularity recently. In this paper, we use a non-deterministic Flower Pollination Algorithm (FPA) to deal with the problem's complexity and compute feasible and quasi-optimal trajectories for fixed-wing UAVs in complex 3D environments, taking into account the vehicle's flight properties. The global optimization algorithm is improved with the addition of a deterministic 2-opt local search providing a significant improvement. To achieve real-time performance, the proposed trajectory planner in implemented and parallelized following the data-parallel paradigm on a Graphics Processing Unit (GPU) using the Compute Unified Device Architecture (CUDA) resulting in a 253.4x speedup compared to the sequential implementation on CPU. The parallel implementation is able to compute quasi-optimal trajectories in just 0.369 s.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have