Navigation underwater traditionally is done by keeping a safe distance from obstacles, resulting in "fly-overs" of the area of interest. An Autonomous Underwater Vehicle (AUV) moving through a cluttered space, such as a shipwreck, or a decorated cave is an extremely challenging problem and has not been addressed in the past. This paper proposed a novel navigation framework utilizing an enhanced version of Trajopt for fast 3D path-optimization with near-optimal guarantees for AUVs. A sampling based correction procedure ensures that the planning is not limited by local minima, enabling navigation through narrow spaces. The method is shown, both on simulation and in-pool experiments, to be fast enough to enable real-time autonomous navigation for an Aqua2 AUV with strong safety guarantees.
 Autonomous Underwater Vehicles (AUVs) usually operate in ocean environments characterized by complex spatial variability which can jeopardize their missions. To avoid this, planning safety routes with minimum energy cost is of primary importance. This work revisits the benefits, in terms of travelling time, of path planning in marine environments showing spatial variability. By means of a path planner presented in a previous paper, this work focuses on the application to a real environment of such techniques. Extensive computations have been carried out to calculate optimal paths on realistic ocean environments, based on autonomous underwater glider properties as the mobile platform. Unlike previous works, the more realistic and applied case of an autonomous underwater glider surveying the Western Mediterranean Sea is considered. Results indicate that substantial energy savings of planned paths compared to straight line trajectories are obtained when the current intensity and the vehicle speed are comparable. Conversely, the straight line path betwe en starting and ending points can be considered an optimum path when the current speed does not exceed half of the vehicle velocity. In both situations, benefits of path planning seem dependent also on the spatial structure of the current field. The goal of adaptive sampling in the ocean is to predict the types and locations of additional ocean measurements that would be most useful to collect. Quantitatively, what is most useful is defined by an objective function and the goal is then to optimize this objective under the constraints of the available observing network. Examples of objectives are better oceanic understanding, to improve forecast quality, or to sample regions of high interest. This work provides a new path-planning scheme for the adaptive sampling problem. We define the path-planning problem in terms of an optimization framework and propose a method based on mixed integer linear programming (MILP). The mathematical goal is to find the vehicle path that maximizes the line integral of the uncertainty of field estimates along this path. Sampling this path can improve the accuracy of the field estimates the most. While achieving this objective, several constraints must be satisfied and are implemented. They relate to vehicle motion, intervehicle coordination, communication, collision avoidance, etc. The MILP formulation is quite powerful to handle different problem constraints and flexible enough to allow easy extensions of the problem. The formulation covers single- and multiple-vehicle cases as well as single- and multiple-day formulations. The need for a multiple-day formulation arises when the ocean sampling mission is optimized for several days ahead. We first introduce the details of the formulation, then elaborate on the objective function and constraints, and finally, present a varied set of examples to illustrate the applicability of the proposed method. This paper proposes a genetic algorithm (GA) for path planning of an autonomous underwater vehicle in an ocean environment characterized by strong currents and enhanced space-time variability. The goal is to find a safe path that takes the vehicle from its starting location to a mission-specified destination, minimizing the energy cost. The GA includes novel genetic operators that ensure the convergence to the global minimum even in cases where the structure (in space and time) of the current field implies the existence of different local minima. The performance of these operators is discussed. The proposed algorithm is suitable for situations in which the vehicle has to operate energy-exhaustive missions. Efficient path-planning algorithms are a crucial issue for modern autonomous underwater vehicles. Classical path-planning algorithms in artificial intelligence are not designed to deal with wide continuous environments prone to currents. We present a novel Fast Marching (FM)-based approach to address the following issues. First, we develop an algorithm we call FM* to efficiently extract a 2-D continuous path from a discrete representation of the environment. Second, we take underwater currents into account thanks to an anisotropic extension of the original FM algorithm. Third, the vehicle turning radius is introduced as a constraint on the optimal path curvature for both isotropic and anisotropic media. Finally, a multiresolution method is introduced to speed up the overall path-planning process