Trajectory Planning and Optimization for Minimizing Uncertainty in Persistent Monitoring Applications

Abstract

This paper considers persistent monitoring of environmental phenomena using unmanned aerial vehicles (UAVs). The objective is to generate periodic dynamically feasible UAV trajectories that minimize the estimation uncertainty at a set of points of interest in the environment. We develop an optimization algorithm that iterates between determining the observation periods for a set of ordered points of interest and optimizing a continuous UAV trajectory to meet the required observation periods and UAV dynamics constraints. The interest-point visitation order is determined using a Traveling Salesman Problem (TSP), followed by a greedy optimization algorithm to determine the number of observations that minimizes the maximum steady-state eigenvalue of a Kalman filter estimator. Given the interest-point observation periods and visitation order, a minimum-jerk trajectory is generated from a bi-level optimization, formulated as a convex quadratically constrained quadratic program. The resulting B-spline trajectory is guaranteed to be feasible, meeting the observation duration, maximum velocity and acceleration, region enter and exit constraints. The feasible trajectories outperform existing methods by achieving comparable observability at up to 47% higher travel speeds, resulting in lower maximum estimation uncertainty.

Water Quality Sampling and Multi-Parameter Monitoring System Based on Multi-Rotor UAV Implementation

“…In order to minimize the flight time of UAVs in water sampling, and considering geographical threats and the locations of sampling points, an optimal collision-avoidance flight path was planned to improve flight efficiency and reduce losses. To achieve the shortest UAV flight path, a combined optimization problem of UAV sampling point sequence planning and flight trajectory collision avoidance was addressed [36]. This research proposed a dual-layer combined path planning algorithm based on LHIPSO and RRT.…”

Optimal Persistent Monitoring of Mobile Targets in One Dimension

“…The graph-based formulation was further generalized in [12], in which targets were grouped into clusters and only a single target within each cluster must be visited. Due to the combinatorial nature of the scheduling task, the use of mixed-integer optimization is natural [13], and its similarity to the Traveling Salesman Problem has motivated solving the higher level scheduler with such methods [14]. On the lower level, the problem consists of optimizing the agents' motion control, either along a given path, or in order to realize a given schedule.…”