Publication

Abstract : The paper computes optimal paths for fixed-wing unmanned aerial vehicles with bounded turn radii to follow a series of waypoints with specified directions in a three-dimensional obstacle-filled environment. In the existing literature, it was proved that the optimal path is of circular turn–straight line–circular turn (CSC) type for two consecutive waypoint configurations, when the points are sufficiently far apart and there is no obstacle in the field. The maximum of all minimum turn radii corresponding to all possible two-dimensional circular maneuvers was used for both the initial and final turns to develop the CSC-type paths. But, this paper considers the minimum turn radii for initial and final turns, corresponding to the maneuvering planes and which produces shorter CSC-type paths. In an obstacle-filled environment the shortest path may collide with obstacles, so a strategy is proposed to switch to the next best path that does not collide with obstacles. Using this technique, a series of waypoints is followed in the presence of obstacles of different types, for example, cylindrical, hemispherical, and spherical in shapes with different sizes. Finally, simulation results are presented to show the efficiency of the algorithm for obstacle avoidance. The computation time listed here indicates the potentiality of this algorithm for implementation in real time.