Abstract:Cooperating autonomous underwater vehicles (AUVs) often rely on acoustic communication to coordinate their actions effectively. However, the reliability of underwater acoustic communication decreases as the communication range between vehicles increases. Consequently, teams of cooperating AUVs typically make conservative assumptions about the maximum range at which they can communicate reliably. To address this limitation, we propose a novel approach that involves learning a map representing the probability of successful communication based on the locations of the transmitting and receiving vehicles. This probabilistic communication map accounts for factors such as the range between vehicles, environmental noise, and multi-path effects at a given location. In pursuit of this goal, we investigate the application of Gaussian process binary classification to generate the desired communication map. We specialize existing results to this specific binary classification problem and explore methods to incorporate uncertainty in vehicle location into the mapping process. Furthermore, we compare the prediction performance of the probability communication map generated using binary classification with that of a signal-to-noise ratio (SNR) communication map generated using Gaussian process regression. Our approach is experimentally validated using communication and navigation data collected during trials with a pair of Virginia Tech 690 AUVs.
Abstract:In this paper, we seek to evaluate the effectiveness of a novel forward-looking sonar system with a limited number of beams for collision avoidance for small autonomous underwater vehicles (AUVs). We present a collision avoidance strategy specifically designed for a novel forward-looking sonar system based on posterior expected loss, explicitly coupling the obstacle detection, collision avoidance, and planning. We demonstrate the strategy with field trials using the 690 AUV, built by the Center for Marine Autonomy and Robotics at Virginia Tech, and verify the forward-looking sonar system using a prototype sonar with nine beams. Post-processed simulations are performed while changing parameters in the sensitivity of the system to demonstrate the trade-off between the detection and false alarm rates.
Abstract:This paper addresses the challenges of optimally placing a finite number of sensors to detect Poisson-distributed targets in a bounded domain. We seek to rigorously account for uncertainty in the target arrival model throughout the problem. Sensor locations are selected to maximize the probability that no targets are missed. While this objective function is well-suited to applications where failure to detect targets is highly undesirable, it does not lead to a computationally efficient optimization problem. We propose an approximation of the objective function that is non-negative, submodular, and monotone and for which greedy selection of sensor locations works well. We also characterize the gap between the desired objective function and our approximation. For numerical illustrations, we consider the case of the detection of ship traffic using sensors mounted on the seafloor.
Abstract:We seek to rigorously evaluate the benefit of using a few beams rather than a single beam for a low-cost obstacle avoidance sonar for small AUVs. For a small low-cost AUV, the complexity, cost, and volume required for a multi-beam forward looking sonar are prohibitive. In contrast, a single-beam system is relatively easy to integrate into a small AUV, but does not provide the performance of a multi-beam solution. To better understand this trade-off, we seek to rigorously quantify the improvement with respect to obstacle avoidance performance of adding just a few beams to a single-beam forward looking sonar relative to the performance of the single-beam system. Our work fundamentally supports the goal of using small low-cost AUV systems in cluttered and unstructured environments. Specifically, we investigate the benefit of incorporating a port and starboard beam to a single-beam sonar system for collision avoidance. A methodology for collision avoidance is developed to obtain a fair comparison between a single-beam and multi-beam system, explicitly incorporating the geometry of the beam patterns from forward-looking sonars with large beam angles, and simulated using a high-fidelity representation of acoustic signal propagation.
Abstract:This paper describes a high-fidelity sonar model and a simulation environment that implements the model. The model and simulation environment have been developed to aid in the design of a forward looking sonar for autonomous underwater vehicles (AUVs). The simulator achieves real-time visualization through ray tracing and approximation. The simulator facilitates the assessment of sonar design choices, such as beam pattern and beam location, and assessment of obstacle detection and tracking algorithms. An obstacle detection model is proposed for which the null hypothesis is estimated from the environmental model. Sonar data is generated from the simulator and compared to the expected results from the detection model demonstrating the benefits and limitations of the proposed approach.
Abstract:In this work, we present an aided inertial navigation system for an autonomous underwater vehicle (AUV) using an unscented Kalman filter on manifolds (UKF-M). The inertial navigation estimate is aided by a Doppler velocity log (DVL), depth sensor, acoustic range and, while on the surface, GPS. The sensor model for each navigation sensor on the AUV is explicitly described, including compensation for lever arm offsets between the IMU and each sensor. Additionally, an outlier rejection step is proposed to reject measurement outliers that would degrade navigation performance. The UKF-M for AUV navigation is implemented for real-time navigation on the Virginia Tech 690 AUV and validated in the field. Finally, by post-processing the navigation sensor data, we show experimentally that the UKF-M is able to converge to the correct heading in the presence of arbitrarily large initial heading error.
Abstract:We present the results of experiments performed using a small autonomous underwater vehicle to determine the location of an isobath within a bounded area. The primary contribution of this work is to implement and integrate several recent developments real-time planning for environmental mapping, and to demonstrate their utility in a challenging practical example. We model the bathymetry within the operational area using a Gaussian process and propose a reward function that represents the task of mapping a desired isobath. As is common in applications where plans must be continually updated based on real-time sensor measurements, we adopt a receding horizon framework where the vehicle continually computes near-optimal paths. The sequence of paths does not, in general, inherit the optimality properties of each individual path. Our real-time planning implementation incorporates recent results that lead to performance guarantees for receding-horizon planning.
Abstract:In this paper, we propose decentralized and scalable algorithms for Gaussian process (GP) training and prediction in multi-agent systems. To decentralize the implementation of GP training optimization algorithms, we employ the alternating direction method of multipliers (ADMM). A closed-form solution of the decentralized proximal ADMM is provided for the case of GP hyper-parameter training with maximum likelihood estimation. Multiple aggregation techniques for GP prediction are decentralized with the use of iterative and consensus methods. In addition, we propose a covariance-based nearest neighbor selection strategy that enables a subset of agents to perform predictions. The efficacy of the proposed methods is illustrated with numerical experiments on synthetic and real data.
Abstract:Gaussian processes (GPs) are a well-known nonparametric Bayesian inference technique, but they suffer from scalability problems for large sample sizes, and their performance can degrade for non-stationary or spatially heterogeneous data. In this work, we seek to overcome these issues through (i) employing variational free energy approximations of GPs operating in tandem with online expectation propagation steps; and (ii) introducing a local splitting step which instantiates a new GP whenever the posterior distribution changes significantly as quantified by the Wasserstein metric over posterior distributions. Over time, then, this yields an ensemble of sparse GPs which may be updated incrementally, and adapts to locality, heterogeneity, and non-stationarity in training data.