Path Planning for UAVs Under Communication Constraints Using SPLAT! and MILP

  • Authors:
  • Esten Ingar Grøtli;Tor Arne Johansen

  • Affiliations:
  • Department of Engineering Cybernetics, O.S. Bragstads plass 2D, Trondheim, Norway 7491;Department of Engineering Cybernetics, O.S. Bragstads plass 2D, Trondheim, Norway 7491

  • Venue:
  • Journal of Intelligent and Robotic Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We will in this paper address the problem of offline path planning for Unmanned Aerial Vehicles (UAVs). Our goal is to find paths that meet mission objectives, are safe with respect to collision and grounding, fuel efficient and satisfy criteria for communication. Due to the many nonconvex constraints of the problem, Mixed Integer Linear Programming (MILP) will be used in finding the path. Approximate communication constraints and terrain avoidance constraints are used in the MILP formulation. To achieve more accurate prediction of the ability to communicate, the path is then analyzed in the radio propagation toolbox SPLAT!, and if the UAVs are not able to communicate according to design criteria for bandwidth, constraints are modified in the optimization problem in an iterative manner. The approach is exemplified with the following setup: The path of two UAVs are planned so they can serve as relay nodes between a target without line of sight to the base station.