The DOI matches its Crossref record.
Using Backprojections for Fine Motion Planning with Uncertainty
Abstract
This paper outlines a method for planning motions in the presence of uncertainty. Tasks are modeled as geometrical goals in configuration space. The planning process consists of determining regions from which particular motions are guar anteed to reach a desired goal successfully. An algorithm is presented for backprojecting from desired goal states. The backprojection regions are computed by erecting constraints that geometrically capture the uncertainty in motion. The relationship of backprojections to goal recognizability is discussed within the formal framework of preimages. This relationship suggests a partitioning of desired goal states into recognizable goal states. Backprojections are actually per formed from this partitioning.
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
Cited by
An exploration of sensorless manipulation
Erdmann, M. A., & Mason, M. T. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.800 · Cited by 463
Self-citationGlobal path planning using artificial potential fields
Warren, C. W. (2003) · Proceedings, 1989 International Conference on Robotics and Automation · doi:10.1109/robot.1989.100007 · Cited by 370
Integrated task and motion planning in belief space
Kaelbling, L. P., & Lozano-Pérez, T. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913484072 · Cited by 328
Acquiring robot skills via reinforcement learning
(1994) · IEEE Control Systems · doi:10.1109/37.257890 · Cited by 206
Metadata
- Authors
- Erdmann, M.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 1986-03
- Volume
- 5
- Issue
- 1
- Pages
- 19-45
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2153759243
- Cited by
- 252
- References
- 0
- FWCI
- 13.78
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Using Backprojections for Fine Motion Planning with Uncertainty. https://app.cochat.ai/papers/10.1177/027836498600500102
- The paper
- Erdmann, M. (1986). Using Backprojections for Fine Motion Planning with Uncertainty. The International Journal of Robotics Research. https://doi.org/10.1177/027836498600500102
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.