@article{Ayton_Williams_Camilli_2019, title={Measurement Maximizing Adaptive Sampling with Risk Bounding Functions}, volume={33}, url={https://ojs.aaai.org/index.php/AAAI/article/view/4742}, DOI={10.1609/aaai.v33i01.33017511}, abstractNote={<p>In autonomous exploration a mobile agent must adapt to new measurements to seek high reward, but disturbances cause a probability of collision that must be traded off against expected reward. This paper considers an autonomous agent tasked with maximizing measurements from a Gaussian Process while subject to unbounded disturbances. We seek an adaptive policy in which the maximum allowed probability of failure is constrained as a function of the expected reward. The policy is found using an extension to Monte Carlo Tree Search (MCTS) which bounds probability of failure. We apply MCTS to a sequence of approximating problems, which allows constraint satisfying actions to be found in an anytime manner. Our innovation lies in defining the approximating problems and replanning strategy such that the probability of failure constraint is guaranteed to be satisfied over the true policy. The approach does not need to plan for all measurements explicitly or constrain planning based only on the measurements that were observed. To the best of our knowledge, our approach is the first to enforce probability of failure constraints in adaptive sampling. Through experiments on real bathymetric data and simulated measurements, we show our algorithm allows an agent to take dangerous actions only when the reward justifies the risk. We then verify through Monte Carlo simulations that failure bounds are satisfied.</p>}, number={01}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Ayton, Benjamin and Williams, Brian and Camilli, Richard}, year={2019}, month={Jul.}, pages={7511-7519} }