11 research outputs found

    A Novel Efficient Task-Assign Route Planning Method for AUV Guidance in a Dynamic Cluttered Environment

    Full text link
    Promoting the levels of autonomy facilitates the vehicle in performing long-range operations with minimum supervision. The capability of Autonomous Underwater Vehicles (AUVs) to fulfill the mission objectives is directly influenced by route planning and task assignment system performance. The system fives the error of "Bad character(s) in field Abstract" for no reason. Please refer to manuscript for the full abstractComment: 7 pages, 8 figures, conference paper, IEEE Congress on Evolutionary Computation (CEC). Vancouver, Canada. July 201

    Comparison of Guidance Modes for the AUV “Slocum Glider ” in Time-Varying Ocean Flows

    Get PDF
    Abstract — This paper presents possibilities for the reliable guidance of an AUV “Slocum Glider ” in a time-varying oceans flows. The presented guidance modes consider the restricted information during a real mission about the actual position and ocean current conditions as well as the available control modes of a glider. A faster-than-real-time, full software stack simulator for the Slocum glider will be described in order to test the developed guidance modes under real mission conditions. Keywords—component; AUV “Slocum Glider”; Path Planning; Glider Simulator; Time-Varying Ocean Flows; Dead Reckonin

    Clustering-based algorithms for multi-vehicle task assignment in a time-invariant drift field

    Get PDF
    This paper studies the multi-vehicle task assignment problem where several dispersed vehicles need to visit a set of target locations in a time-invariant drift field while trying to minimize the total travel time. Using optimal control theory, we first design a path planning algorithm to minimize the time for each vehicle to travel between two given locations in the drift field. The path planning algorithm provides the cost matrix for the target assignment, and generates routes once the target locations are assigned to a vehicle. Then, we propose several clustering strategies to assign the targets, and we use two metrics to determine the visiting sequence of the targets clustered to each vehicle. Mainly used to specify the minimum time for a vehicle to travel between any two target locations, the cost matrix is obtained using the path planning algorithm, and is in general asymmetric due to time-invariant currents of the drift field. We show that one of the clustering strategies can obtain a min-cost arborescence of the asymmetric target vehicle graph where the weight of a directed edge between two vertices is the minimum travel time from one vertex to the other respecting the orientation. Using tools from graph theory, a lower bound on the optimal solution is found, which can be used to measure the proximity of a solution from the optimal. Furthermore, by integrating the target clustering strategies with the target visiting metrics, we obtain several task assignment algorithms. Among them, two algorithms guarantee that all the target locations will be visited within a computable maximal travel time, which is at most twice of the optimal when the cost matrix is symmetric. Finally, numerical simulations show that the algorithms can quickly lead to a solution that is close to the optimal

    Modeling for the performance of navigation, control and data post-processing of underwater gliders

    Get PDF
    Underwater gliders allow efficient monitoring in oceanography. In contrast to buoys, which log oceanographic data at individual depths at only one location, gliders can log data over a period of up to one year by following predetermined routes. In addition to the logged data from the available sensors, usually a conductivity-temperature-depth (CTD) sensor, the depth-average velocity can also be estimated using the horizontal glider velocity and the GPS update in a dead-reckoning algorithm. The horizontal velocity is also used for navigation or planning a long-term glider mission. This paper presents an investigation to determine the horizontal glider velocity as accurately as possible. For this, Slocum glider flight models used in practice will be presented and compared. A glider model for a steady-state gliding motion based on this analysis is described in detail. The approach for estimating the individual model parameters using nonlinear regression will be presented. In this context, a robust method to accurately detect the angle of attack is presented and the requirements of the logged vehicle data for statistically verified model parameters are discussed. The approaches are verified using logged data from glider missions in the Indian Ocean from 2016 to 2018. It is shown that a good match between the logged and the modeled data requires a time-varying model, where the model parameters change with respect to time. A reason for the changes is biofouling, where organisms settle and grow on the glider. The proposed method for deciphering an accurate horizontal glider velocity could serve to improve the dead-reckoning algorithm used by the glider for calculating depth-average velocity and for understanding its errors. The depth-average velocity is used to compare ocean current models from CMEMS and HYCOM with the glider logged data

    Optimal routing strategies for autonomous underwater vehicles in time-varying environment

    No full text
    This paper presents a mission system and the therein implemented algorithms for path planning in a time-varying environment based on graph methods. The basic task of the introduced path planning algorithms is to find a time-optimal path from a defined start position to a goal position with consideration of the time-varying ocean current for an autonomous underwater vehicle (AUV). Building on this, additional practice-oriented considerations in planning are discussed in this paper. Such points are the discussion of possible methods to accelerate the algorithms and the determination of the optimal departure time. The solutions and algorithms presented in this paper are focused on path planning requirements for the AUV "SLOCUM Glider". These algorithms are equally applicable to other AUVs or aerial mobile autonomous systems. \ua9 2013 Elsevier B.V. All rights reserved.Peer reviewed: YesNRC publication: Ye
    corecore