The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Dynamic path planning in sensor-based terrain acquisition
Abstract
The terrain acquisition problem is formulated as that of continuous motion planning, and no constraints are imposed on obstacle geometry. Two algorithms are described for acquiring planar terrains with obstacles of arbitrary shape. Estimates of the algorithm performance are derived as upper bounds on the lengths of generated paths.>
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
Sonar-based real-world mapping and navigation
Elfes, A. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087096 · Cited by 1,397
Lumelsky, V. J., & Stepanov, A. A. (1987) · Algorithmica · doi:10.1007/bf01840369 · Cited by 699
Self-citation
Cited by
A survey on coverage path planning for robotics
Galceran, E., & Carreras, M. (2013) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2013.09.004 · Cited by 1,575
Optimal and Efficient Path Planning for Partially Known Environments
Stentz, A. (1997) · Intelligent Unmanned Ground Vehicles · doi:10.1007/978-1-4615-6325-9_11 · Cited by 1,233
Coverage for robotics – A survey of recent results
Choset, H. (2001) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1016639210559 · Cited by 1,209
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
Optimal and efficient path planning for partially-known environments
Stentz, A. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.351061 · Cited by 929
Metadata
- Authors
- Lumelsky, V. J., Mukhopadhyay, S., & Sun, K.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 1990
- Volume
- 6
- Issue
- 4
- Pages
- 462-472
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2067168270
- Cited by
- 204
- References
- 2
- FWCI
- 6.59
- 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.