Fast Marching Adaptive Sampling

A challenging problem for autonomous exploration is estimating the utility of future samples. In this paper, we consider the problem of placing observations over an initially unknown continuous cost field to find the least-cost path from a fixed start to a fixed goal position. We propose the adaptive sequential sampling algorithm FMEx to successively select observation locations that maximize the probability of improving the best path. FMEx evaluates a set of proposed observation locations using a novel fast marching update method and selects a location based on the probabilistic likelihood of improving the current best path. Simulated results show that FMEx finds lower-cost paths with fewer samples than random, maximum variance and confidence bound sampling. We also show results for sampling bathymetric data to find the best route for a submarine cable. In problems where sampling is expensive, FMEx selects observation locations that minimize the true path cost.

[1]  Yan Pailhas,et al.  Path Planning for Autonomous Underwater Vehicles , 2007, IEEE Transactions on Robotics.

[2]  Nicholas R. J. Lawrance,et al.  Learning to soar: Resource-constrained exploration in reinforcement learning , 2015, Int. J. Robotics Res..

[3]  Anthony Stentz,et al.  Using interpolation to improve path planning: The Field D* algorithm , 2006, J. Field Robotics.

[4]  Fabio Tozeto Ramos,et al.  Bayesian optimisation for Intelligent Environmental Monitoring , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Yasamin Mostofi,et al.  Communication-Aware Motion Planning in Mobile Networks , 2011, IEEE Transactions on Automatic Control.

[6]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Roland Siegwart,et al.  An Interpolated Dynamic Navigation Function , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[8]  Andreas Krause,et al.  Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization , 2010, J. Artif. Intell. Res..

[9]  C. H. Elmendorf,et al.  Oceanographic information for engineering submarine cable systems , 1957 .

[10]  Surya P. N. Singh,et al.  Integrated electro-aeromechanical structures for low-cost, self-deploying environment sensors and disposable UAVs , 2013, 2013 IEEE International Conference on Robotics and Automation.

[11]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[12]  Christopher K. I. Williams,et al.  Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning) , 2005 .

[13]  Eric W. Frew,et al.  Unmanned Aircraft Guidance for Penetration of Pretornadic Storms , 2008 .

[14]  Wei Hong,et al.  Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.

[15]  Luis Moreno,et al.  Performance analysis of fast marching-based motion planning for autonomous mobile robots in ITER scenarios , 2015, Robotics Auton. Syst..

[16]  Alexander Vladimirsky,et al.  Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms , 2003, SIAM J. Numer. Anal..

[17]  Luis Moreno,et al.  Path Planning for Mobile Robot Navigation using Voronoi Diagram and Fast Marching , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[18]  David M. Doolin,et al.  Wireless sensors for wildfire monitoring , 2005, SPIE Smart Structures and Materials + Nondestructive Evaluation and Health Monitoring.