The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Anytime path planning and replanning in dynamic environments
Abstract
We present an efficient, anytime method for path planning in dynamic environments. Current approaches to planning in such domains either assume that the environment is static and replan when changes are observed, or assume that the dynamics of the environment are perfectly known a priori. Our approach takes into account all prior information about both the static and dynamic elements of the environment, and efficiently updates the solution when changes to either are observed. As a result, it is well suited to robotic path planning in known or unknown environments in which there are mobile objects, agents or adversaries
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
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 1×
“As a result, randomized approaches such as Rapidlyexploring Random Trees (RRTs) and Probabilistic Roadmaps (PRMs) have been widely-used in these domains [2], [3].”
BackgroundPrinciples of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“A popular technique in mobile robot navigation is to uniformly discretize the configuration space and then plan an optimal trajectory through this discretized representation using Dijkstra’s algorithm or A* [1].”
Method
Cited by
Fast minimum uncertainty search on a graph map representation
Carrillo, H., Latif, Y., Neira, J., & Castellanos, J. A. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6385927 · Cited by 20
Metadata
- Authors
- van den Berg, J., Ferguson, D., & Kuffner, J.
- Venue
- Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.
- Publisher
- IEEE
- Published
- 2006-07-10
- Pages
- 2366-2371
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2111112078
- Cited by
- 241
- References
- 2
- FWCI
- 13.57
- 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: Anytime path planning and replanning in dynamic environments. https://app.cochat.ai/papers/10.1109/robot.2006.1642056
- The paper
- van den Berg, J., Ferguson, D., & Kuffner, J. (2006). Anytime path planning and replanning in dynamic environments. Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. https://doi.org/10.1109/robot.2006.1642056
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.
