The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Efficient Informative Sensing using Multiple Robots
Open accessAbstract
The need for efficient monitoring of spatio-temporal dynamics in large environmental applications, such as the water quality monitoring in rivers and lakes, motivates the use of robotic sensors in order to achieve sufficient spatial coverage. Typically, these robots have bounded resources, such as limited battery or limited amounts of time to obtain measurements. Thus, careful coordination of their paths is required in order to maximize the amount of information collected, while respecting the resource constraints. In this paper, we present an efficient approach for near-optimally solving the NP-hard optimization problem of planning such informative paths. In particular, we first develop eSIP (efficient Single-robot Informative Path planning), an approximation algorithm for optimizing the path of a single robot. Hereby, we use a Gaussian Process to model the underlying phenomenon, and use the mutual information between the visited locations and remainder of the space to quantify the amount of information collected. We prove that the mutual information collected using paths obtained by using eSIP is close to the information obtained by an optimal solution. We then provide a general technique, sequential allocation, which can be used to extend any single robot planning algorithm, such as eSIP, for the multi-robot problem. This procedure approximately generalizes any guarantees for the single-robot problem to the multi-robot case. We extensively evaluate the effectiveness of our approach on several experiments performed in-field for two important environmental sensing applications, lake and river monitoring, and simulation experiments performed using several real world sensor network data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
An analysis of approximations for maximizing submodular set functions - 1Preprint
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · RePEc: Research Papers in Economics · Cited by 837
KrauseAndreas, SinghAjit, & GuestrinCarlos (2008) · Journal of Machine Learning Research · doi:10.5555/1390681.1390689 · Cited by 815
Information Gain-based Exploration Using Rao-Blackwellized Particle Filters
Stachniss, C., Grisetti, G., & Burgard, W. (2005) · Robotics: Science and Systems I · doi:10.15607/rss.2005.i.009 · Cited by 542
Coordination for Multi-Robot Exploration and Mapping
Simmons, R. G., Apfelbaum, D., Burgard, W., Fox, D., Moors, M., Thrun, S., & Younes, H. L. S. (2000) · Cited by 502
Near-optimal sensor placements in Gaussian processes
Guestrin, C., Krause, A., & Singh, A. P. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102385 · Cited by 454
Self-citationInformation 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
Near-optimal observation selection using submodular functions
Krause, A., & Guestrin, C. (2007) · Cited by 281
Self-citationMobile Element Scheduling with Dynamic Deadlines
Somasundara, A. A., Ramamoorthy, A., & Srivastava, M. B. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.57 · Cited by 265
MacIntyre, S., Romero, J. R., & Kling, G. W. (2002) · Limnology and Oceanography · doi:10.4319/lo.2002.47.3.0656 · Cited by 211
Approximation Algorithms for Orienteering and Discounted-Reward TSP
Blum, A., Chawla, S., Karger, D. R., Lane, T., Meyerson, A., & Minkoff, M. (2007) · SIAM Journal on Computing · doi:10.1137/050645464 · Cited by 198
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
Calinescu, G., Chekuri, C., Pál, M., & Vondrák, J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72792-7_15 · Cited by 187
Efficient Planning of Informative Paths for Multiple Robots
Singh, A., Singh, A., Krause, A., Krause, A., Guestrin, C., Kaiser, W., & Batalin, M. A. (2006) · eScholarship (California Digital Library) · Cited by 168
Self-citationMacIntyre, S. (1993) · Limnology and Oceanography · doi:10.4319/lo.1993.38.4.0798 · Cited by 165
Nonmyopic informative path planning in spatio-temporal models
Meliou, A., Krause, A., Guestrin, C., & Hellerstein, J. M. (2007) · Cited by 86
Self-citationIntelligent Maps for Autonomous Kilometer-Scale Science Survey
Thompson, D. R., & Wettergreen, D. S. (2018) · doi:10.1184/r1/6555206 · Cited by 29
Dynamic action spaces for information gain maximization in search and exploration
Roy, N., & Earnest, C. M. (2006) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2006.1656452 · Cited by 18
Cited by
Active inference and epistemic value
Friston, K., Rigoli, F., Ognibene, D., Mathys, C., Fitzgerald, T., & Pezzulo, G. (2015) · Cognitive Neuroscience · doi:10.1080/17588928.2015.1020053 · Cited by 731
Sensor Planning for a Symbiotic UAV and UGV System for Precision Agriculture
Tokekar, P., Hook, J. V., Mulla, D., & Isler, V. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2603528 · Cited by 524
Sampling-based robotic information gathering algorithms
Hollinger, G. A., & Sukhatme, G. S. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914533443 · Cited by 334
Martinez-Cantin, R., de Freitas, N., Brochu, E., Castellanos, J., & Doucet, A. (2009) · Autonomous Robots · doi:10.1007/s10514-009-9130-2 · Cited by 217
Indelman, V., Carlone, L., & Dellaert, F. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364914561102 · Cited by 154
Metadata
- Authors
- Singh, A., Krause, A., Guestrin, C., & Kaiser, W. J.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2009-04-27
- Volume
- 34
- Pages
- 707-755
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2125069195
- Cited by
- 255
- References
- 16
- FWCI
- 9.89
- Type
- journal article
- Language
- en
- Open access
- diamond
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.