no code implementations • 15 Jan 2014 • Amarjeet Singh, Andreas Krause, Carlos Guestrin, William J. Kaiser
In this paper, we present an efficient approach for near-optimally solving the NP-hard optimization problem of planning such informative paths.