The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Collaborative multi-robot exploration
Abstract
In this paper we consider the problem of exploring an unknown environment by a team of robots. As in single-robot exploration the goal is to minimize the overall exploration time. The key problem to be solved therefore is to choose appropriate target points for the individual robots so that they simultaneously explore different regions of their environment. We present a probabilistic approach for the coordination of multiple robots which, in contrast to previous approaches, simultaneously takes into account the costs of reaching a target point and the utility of target points. The utility of target points is given by the size of the unexplored area that a robot can cover with its sensors upon reaching a target position. Whenever a target point is assigned to a specific robot, the utility of the unexplored area visible from this target position is reduced for the other robots. This way, a team of multiple robots assigns different target points to the individual robots. The technique has been implemented and tested extensively in real-world experiments and simulation runs. The results given in this paper demonstrate that our coordination technique significantly reduces the exploration time compared to previous approaches.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“Value iteration updates the value of all grid cells by the value of their best neighbors, plus the cost of moving to this neighbor (just like A* [ 12 ]).”
Background
Cited by
Coordinated multi-robot exploration
Burgard, W., Moors, M., Stachniss, C., & Schneider, F. E. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.839232 · Cited by 1,177
Self-citationInformation 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
Self-citationDistributed Multirobot Exploration and Mapping
Fox, D., Ko, J., Konolige, K., Limketkai, B., Schulz, D., & Stewart, B. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2006.876927 · Cited by 344
Self-citationCurrent State of the Art in Distributed Autonomous Mobile Robotics
Parker, L. E. (2000) · Distributed Autonomous Robotic Systems 4 · doi:10.1007/978-4-431-67919-6_1 · Cited by 276
A system for volumetric robotic mapping of abandoned mines
Thrun, S., Hahnel, D., Ferguson, D., Montemerlo, M., Triebel, R., Burgard, W., Baker, C., Omohundro, Z., Thayer, S., & Whittaker, W. (2004) · 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422) · doi:10.1109/robot.2003.1242260 · Cited by 253
Self-citation
Metadata
- Authors
- Burgard, W., Moors, M., Fox, D., Simmons, R., & Thrun, S.
- Venue
- Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)
- Publisher
- IEEE
- Published
- 2002-11-07
- Volume
- 1
- Pages
- 476-481
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2113739894
- Cited by
- 762
- References
- 2
- FWCI
- 29.16
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Collaborative multi-robot exploration. https://app.cochat.ai/papers/10.1109/robot.2000.844100
- The paper
- Burgard, W., Moors, M., Fox, D., Simmons, R., & Thrun, S. (2002). Collaborative multi-robot exploration. Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065). https://doi.org/10.1109/robot.2000.844100
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.