Branch and bound for informative path planning
Authors:
- 1 May 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10504729,p. 2147-2154
Abstract
We present an optimal algorithm for informative path planning (IPP), using a branch and bound method inspired by feature selection algorithms. The algorithm uses the monotonicity of the objective function to give an objective function-dependent speedup versus brute force search. We present results which suggest that when maximizing variance reduction in a Gaussian process model, the speedup is significant.Keywords
This publication has 17 references indexed in Scilit:
- Acoustically focused adaptive sampling and on-board routing for marine rapid environmental assessmentJournal of Marine Systems, 2009
- Algorithms for subset selection in linear regression2008
- Adaptive modeling, adaptive data assimilation and adaptive samplingPhysica D: Nonlinear Phenomena, 2007
- Nonlinear optimization of autonomous undersea vehicle sampling strategies for oceanographic data‐assimilationJournal of Field Robotics, 2007
- Probabilistic Search for a Moving Target in an Indoor Environment2006
- Fast branch & bound algorithms for optimal feature selectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Randomized Kinodynamic PlanningThe International Journal of Robotics Research, 2001
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- An Exact Algorithm for Maximum Entropy SamplingOperations Research, 1995
- Branch-and-Bound Methods: A SurveyOperations Research, 1966