The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Sampling-based robotic information gathering algorithms
Abstract
We propose three sampling-based motion planning algorithms for generating informative mobile robot trajectories. The goal is to find a trajectory that maximizes an information quality metric (e.g. variance reduction, information gain, or mutual information) and also falls within a pre-specified budget constraint (e.g. fuel, energy, or time). Prior algorithms have employed combinatorial optimization techniques to solve these problems, but existing techniques are typically restricted to discrete domains and often scale poorly in the size of the problem. Our proposed rapidly exploring information gathering (RIG) algorithms combine ideas from sampling-based motion planning with branch and bound techniques to achieve efficient information gathering in continuous space with motion constraints. We provide analysis of the asymptotic optimality of our algorithms, and we present several conservative pruning strategies for modular, submodular, and time-varying information objectives. We demonstrate that our proposed techniques find optimal solutions more quickly than existing combinatorial solvers, and we provide a proof-of-concept field implementation on an autonomous surface vehicle performing a wireless signal strength monitoring task in a lake.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 7×
“The use of sampling-based motion planning algorithms, such as the rapidly-exploring random tree (RRT) (LaValle and Kuffner, 2001) and the probabilistic roadmap (PRM) (Kavraki et al., 1996), has increased enormously in past years.”
MethodInfluentialSampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
LaValle, S. M. (2006) · Cited by 4,177
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Sequential Tests of Statistical Hypotheses
Wald, A. (1945) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731118 · Cited by 1,671
The Open Motion Planning Library
Sucan, I. A., Moll, M., & Kavraki, L. E. (2012) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2012.2205651 · Cited by 1,616
Sequential Tests of Statistical Hypotheses
Wald, A. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-0919-5_18 · Cited by 1,345
Anytime Motion Planning using the RRT*
Karaman, S., Walter, M. R., Perez, A., Frazzoli, E., & Teller, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980479 · Cited by 881
Complexity of the mover's problem and generalizations
Reif, J. H. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.10 · Cited by 765
Multi-AUV Control and Adaptive Sampling in Monterey Bay
Fiorelli, E., Leonard, N. E., Bhatta, P., Paley, D. A., Bachmayer, R., & Fratantoni, D. M. (2006) · IEEE Journal of Oceanic Engineering · doi:10.1109/joe.2006.880429 · Cited by 488
Information based adaptive robotic exploration
Bourgault, F., Makarenko, A. A., Williams, S. B., Grocholsky, B., & Durrant-Whyte, H. F. (2003) · IEEE/RSJ International Conference on Intelligent Robots and System · doi:10.1109/irds.2002.1041446 · Cited by 453 · cited 1×
“Modern applications of next best view planning and belief space planning continue to push the envelope of gradient-based optimization in these domains (Bourgault et al., 2002; van den Berg et al., 2012).”
BackgroundRapidly-exploring Random Belief Trees for motion planning under uncertainty
Bry, A., & Roy, N. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980508 · Cited by 439
Active vision in robotic systems: A survey of recent developments
Chen, S., Li, Y., & Kwok, N. M. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911410755 · Cited by 402
Thrun, S. (1999) · neural information processing systems · Cited by 303
Motion planning under uncertainty using iterative local optimization in belief space
van den Berg, J., Patil, S., & Alterovitz, R. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912456319 · Cited by 299
Efficient Informative Sensing using Multiple Robots
Singh, A., Krause, A., Guestrin, C., & Kaiser, W. J. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2674 · Cited by 255
Efficient Informative Sensing using Multiple Robots
Singh, A., Krause, A., Guestrin, C., & Kaiser, W. J. (2010) · Cited by 245
Persistent ocean monitoring with underwater gliders: Adapting sampling resolution
Smith, R. N., Schwager, M., Smith, S. L., Jones, B. H., Rus, D., & Sukhatme, G. S. (2011) · Journal of Field Robotics · doi:10.1002/rob.20405 · Cited by 216
Self-citationActive planning for underwater inspection and the benefit of adaptivity
Hollinger, G. A., Englot, B., Hover, F. S., Mitra, U., & Sukhatme, G. S. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912467485 · Cited by 177
Self-citationBranch and bound for informative path planning
Binney, J., & Sukhatme, G. S. (2012) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2012.6224902 · Cited by 174
Self-citationGaussian process modeling of large‐scale terrain
Vasudevan, S., Ramos, F., Nettleton, E., & Durrant‐Whyte, H. (2009) · Journal of Field Robotics · doi:10.1002/rob.20309 · Cited by 170
Efficient Multi-robot Search for a Moving Target
Hollinger, G., Singh, S., Djugash, J., & Kehagias, A. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364908099853 · Cited by 158
Self-citationSubmodularity and its applications in optimized information gathering
Krause, A., & Guestrin, C. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1989734.1989736 · Cited by 145
Sampling-based Motion Planning for Robotic Information Gathering
Hollinger, G. A., & Sukhatme, G. S. (2013) · Robotics: Science and Systems · doi:10.15607/rss.2013.ix.051 · Cited by 99
Self-citationInformation-Rich Path Planning with General Constraints Using Rapidly-Exploring Random Trees
Levine, D., Luders, B. D., & How, J. P. (2010) · AIAA Infotech@Aerospace Conference · doi:10.2514/6.2010-3360 · Cited by 66
A POMDP for multi-view target classification with an autonomous underwater vehicle
Myers, V., & Williams, D. P. (2010) · MTS/IEEE OCEANS Conference (OCEANS) · doi:10.1109/oceans.2010.5664609 · Cited by 17
Simple methods for evaluating and comparing binary experiments
Weber, T. A. (2009) · Theory and Decision · doi:10.1007/s11238-009-9136-4 · Cited by 12
Cited by
A Survey on Active Simultaneous Localization and Mapping: State of the Art and New Frontiers
Placed, J. A., Strader, J., Carrillo, H., Atanasov, N., Indelman, V., Carlone, L., & Castellanos, J. A. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3248510 · Cited by 332
Metadata
- Authors
- Hollinger, G. A., & Sukhatme, G. S.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2014-06-27
- Volume
- 33
- Issue
- 9
- Pages
- 1271-1287
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2143088799
- Cited by
- 334
- References
- 30
- FWCI
- 20.18
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.