Branch and bound for informative path planning

Jonathan Binney, Gaurav S. Sukhatme

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.
BibTeX
@inproceedings{binney2012branch,
  author = {Jonathan Binney and Gaurav S. Sukhatme},
  title = {{Branch and bound for informative path planning}},
  booktitle = {IEEE International Conference on Robotics and Automation},
  year = {2012},
  doi = {10.1109/icra.2012.6224902},
}

Loading related content...

Figure