Optimal and Efficient Path Planning for Partially-Known Environments¶
Stentz, A. (1994). Optimal and Efficient Path Planning for Partially-Known Environments. IEEE, 3310-3317.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Route Replanning
- Formal dynamic-replanning algorithms exist precisely for this — recomputing an optimal path efficiently as the map changes.
This sourceThe cited work establishes Formal dynamic-replanning algorithms exist precisely for this and recomputing an optimal path efficiently as the map changes.
- Formal dynamic-replanning algorithms exist precisely for this — recomputing an optimal path efficiently as the map changes.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:d82726814e52 · see in the full table