Trajectory optimization for high-altitude long endurance UAV maritime radar surveillance

For an unmanned aerial vehicle (UAV) carrying out a maritime radar surveillance mission, there is a tradeoff between maximizing information obtained from the search area and minimizing fuel consumption. This paper presents an approach for the optimization of a UAV's trajectory for maritime radar wide area persistent surveillance to simultaneously minimize fuel consumption, maximize mean probability of detection, and minimize mean revisit time. Quintic polynomials are used to generate UAV trajectories due to their ability to provide complete and complex solutions while requiring few inputs. Furthermore, the UAV dynamics and surveillance mission requirements are used to ensure a trajectory is realistic and mission compatible. A wide area search radar model is used within this paper in conjunction with a discretized grid in order to determine the search area's mean probability of detection and mean revisit time. The trajectory generation method is then used in conjunction with a multi-objective particle swarm optimization (MOPSO) algorithm to obtain a global optimum in terms of path, airspeed (and thus time), and altitude. The performance of the approach is then tested over two common maritime surveillance scenarios and compared to an industry recommended baseline

An Information-Motivated Exploration Agent to Locate Stationary Persons with Wireless Transmitters in Unknown Environments

Unmanned Aerial Vehicles (UAVs) show promise in a variety of applications and recently were explored in the area of Search and Rescue (SAR) for finding victims. In this paper we consider the problem of finding multiple unknown stationary transmitters in a discrete simulated unknown environment, where the goal is to locate all transmitters in as short a time as possible. Existing solutions in the UAV search space typically search for a single target, assume a simple environment, assume target properties are known or have other unrealistic assumptions. We simulate large, complex environments with limited a priori information about the environment and transmitter properties. We propose a Bayesian search algorithm, Information Exploration Behaviour (IEB), that maximizes predicted information gain at each search step, incorporating information from multiple sensors whilst making minimal assumptions about the scenario. This search method is inspired by the information theory concept of empowerment. Our algorithm shows significant speed-up compared to baseline algorithms, being orders of magnitude faster than a random agent and 10 times faster than a lawnmower strategy, even in complex scenarios. The IEB agent is able to make use of received transmitter signals from unknown sources and incorporate both an exploration and search strategy