Fetching the paper…
Reading the bibliography…
The budgeted information gathering problem - where a robot with a fixed fuel budget is required to maximize the amount of information gathered from the world - appears in practice across a wide range of applications in autonomous exploration and inspection with mobile robots.
Planning and acting in partially observable stochastic domains
Leslie Pack Kaelbling, Michael L Littman, and Anthony R Cassandra · 1998
Earlier work this paper cites.
A recursive greedy algorithm for walks in directed graphs
Chandra Chekuri and Martin Pal · 2005
Earlier work this paper cites.
Near-optimal observation selection using submodular functions
Andreas Krause and Carlos Guestrin · 2007
Earlier work this paper cites.
Efficient planning of informative paths for multiple robots
Amarjeet Singh, Andreas Krause, Carlos Guestrin, William Kaiser, and Maxim Batalin · 2007
Earlier work this paper cites.
Efficient sensor placement optimization for securing large water distribution networks
Andreas Krause, Jure Leskovec, Carlos Guestrin, Jeanne VanBriesen, and Christos Faloutsos · 2008
Earlier work this paper cites.
Sarsop: Efficient point-based pomdp planning by approximating optimally reachable belief spaces
Hanna Kurniawati, David Hsu, and Wee Sun Lee · 2008
Earlier work this paper cites.
Nonmyopic adaptive informative path planning for multiple robots
Amarjeet Singh, Andreas Krause, and William J. Kaiser · 2009
Earlier work this paper cites.
Near-optimal bayesian active learning with noisy observations
Daniel Golovin, Andreas Krause, and Debajyoti Ray · 2010
Earlier work this paper cites.
Approximation algorithms for optimal decision trees and adaptive tsp problems
Anupam Gupta, Viswanath Nagarajan, and R Ravi · 2010
Earlier work this paper cites.
Efficient reductions for imitation learning
Stéphane Ross and Drew Bagnell · 2010
Earlier work this paper cites.
Monte-carlo planning in large pomdps
David Silver and Joel Veness · 2010
Earlier work this paper cites.
Adaptive submodularity: Theory and applications in active learning and stochastic optimization
Daniel Golovin and Andreas Krause · 2011
Cited alongside, same era.
Active classification: Theory and application to underwater inspection
Geoffrey A Hollinger, Urbashi Mitra, and Gaurav S Sukhatme · 2011
Cited alongside, same era.
Active planning for underwater inspection and the benefit of adaptivity
Geoffrey A Hollinger, Brendan Englot, Franz S Hover, Urbashi Mitra, and Gaurav S Sukhatme · 2012
Cited alongside, same era.
Submodular function maximization
Andreas Krause and Daniel Golovin · 2012
Cited alongside, same era.
A benchmark for the evaluation of rgb-d slam systems
J. Sturm, N. Engelhard, F. Endres, W. Burgard, and D. Cremers · 2012
Cited alongside, same era.
Sampling-based motion planning for robotic information gathering
Pre- and post-contact policy decomposition for planar contact manipulation under uncertainty
Michael Koval, Nancy Pollard, and Siddhartha Srinivasa · 2014
Later among the works it cites.
Reinforcement and imitation learning via interactive no-regret learning
Stephane Ross and J Andrew Bagnell · 2014
Later among the works it cites.
Correlated orienteering problem and its application to informative path planning for persistent monitoring tasks
Jingjin Yu, Mac Schwager, and Daniela Rus · 2014
Later among the works it cites.
Information-theoretic planning with trajectory optimization for dense 3d mapping
Benjamin Charrow, Gregory Kahn, Sachin Patil, Sikang Liu, Ken Goldberg, Pieter Abbeel, Nathan Michael, and Vijay Kumar · 2015
Later among the works it cites.
Submodular surrogates for value of information, 2015
Yuxin Chen, Shervin Javdani, Amin Karbasi, J. Bagnell, Siddhartha Srinivasa, and Andreas Krause · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Geoffrey A Hollinger and Gaurav S Sukhatme · 2013
Cited alongside, same era.
Submodular optimization with submodular cover and submodular knapsack constraints
Rishabh K Iyer and Jeff A Bilmes · 2013
Cited alongside, same era.
Efficient touch based localization through submodularity
Shervin Javdani, Matthew Klingensmith, J. Andrew (Drew) Bagnell, Nancy Pollard , and Siddhartha Srinivasa · 2013
Cited alongside, same era.
A survey of point-based pomdp solvers
Guy Shani, Joelle Pineau, and Robert Kaplow · 2013
Cited alongside, same era.
Despot: Online pomdp planning with regularization
Adhiraj Somani, Nan Ye, David Hsu, and Wee Sun Lee · 2013
Cited alongside, same era.
Near optimal bayesian active learning for decision making
Shervin Javdani, Yuxin Chen, Amin Karbasi, Andreas Krause, J. Andrew (Drew) Bagnell, and Siddhartha Srinivasa · 2014
Cited alongside, same era.
Efficient visual exploration and coverage with a micro aerial vehicle in unknown environments
Lionel Heng, Alkis Gotovos, Andreas Krause, and Marc Pollefeys
Cited in the paper.
Adaptive stochastic optimization: From sets to paths
Zhan Wei Lim, David Hsu, and Wee Sun Lee · 2015
Later among the works it cites.
Near-optimal bayesian active learning with correlated and noisy tests
Yuxin Chen, S. Hamed Hassani, and Andreas Krause · 2016
Closest in time.
Learning to gather information via imitation: Proofs
Sanjiban Choudhury · 2016
Closest in time.
An information gain formulation for active volumetric 3d reconstruction
Stefan Isler, Reza Sabzevari, Jeffrey Delmerico, and Davide Scaramuzza · 2016
Closest in time.
Adaptive informative path planning in metric spaces
Zhan Wei Lim, David Hsu, and Wee Sun Lee · 2016
Closest in time.
Submodular optimization with routing constraints, 2016
Haifeng Zhang and Yevgeniy Vorobeychik · 2016
Closest in time.