Approximate Sequential Optimization for Informative Path Planning

Joshua Ott, Mykel J. Kochenderfer, Stephen Boyd

We consider the problem of finding an informative path through a graph, given initial and terminal nodes and a given maximum path length. We assume that a linear noise corrupted me…