The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
How to learn an unknown environment. I: the rectilinear case
Open accessAbstract
We consider the problem faced by a robot that must explore and learn an unknown room with obstacles in it. We seek algorithms that achieve a bounded ratio of the worst-case distance traversed in order to see all visible points of the environment (thus creating a map), divided by the optimum distance needed to verify the map, if we had it in the beginning. The situation is complicated by the fact that the latter off-line problem (the problem of optimally verifying a map) is NP-hard. Although we show that there is no such “competitive” algorithm for general obstacle courses, we give a competitive algorithm for the case of a polygonal room with a bounded number of obstacles in it. We restrict ourselves to the rectilinear case, where each side of the obstacles and the room is parallel to one of the coordinates, and the robot must also move either parallel or perpendicular to the sides. (In a subsequent paper, we will discuss the extension to polygons of general shapes.) We also discuss the off-line problem for simple rectilinear polygons and find an optimal solution (in the L 1 metric) in polynomial time, in the case where the entry and the exit are different points.
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
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631
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
Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation
Vidal, R., Shakernia, O., Kim, H. J., Shim, D. H., & Sastry, S. (2002) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2002.804040 · Cited by 528
Geometric Shortest Paths and Network Optimization
Mitchell, J. S. B. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50016-4 · Cited by 427
Distributed control applications within sensor networks
Sinopoli, B., Sharp, C., Schenato, L., Schaffert, S., & Sastry, S. S. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.814926 · Cited by 379
Exploring Unknown Environments
Albers, S., & Henzinger, M. R. (2000) · SIAM Journal on Computing · doi:10.1137/s009753979732428x · Cited by 317
Metadata
- Authors
- Deng, X., Kameda, T., & Papadimitriou, C.
- Venue
- Journal of the ACM
- Published
- 1998-03
- Volume
- 45
- Issue
- 2
- Pages
- 215-245
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2050037634
- Cited by
- 161
- References
- 1
- FWCI
- 12.31
- Type
- journal article
- Language
- en
- Open access
- bronze
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: How to learn an unknown environment. I: the rectilinear case. https://app.cochat.ai/papers/10.1145/274787.274788
- The paper
- Deng, X., Kameda, T., & Papadimitriou, C. (1998). How to learn an unknown environment. I: the rectilinear case. Journal of the ACM. https://doi.org/10.1145/274787.274788
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.