The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Particle RRT for Path Planning with Uncertainty
Abstract
This paper describes a new extension to the rapidly-exploring random tree (RRT) path planning algorithm. The particle RRT algorithm explicitly considers uncertainty in its domain, similar to the operation of a particle filter. Each extension to the search tree is treated as a stochastic process and is simulated multiple times. The behavior of the robot can be characterized based on the specified uncertainty in the environment, and guarantees can be made as to the performance under this uncertainty. Extensions to the search tree, and therefore entire paths, may be chosen based on the expected probability of successful execution. The benefit of this algorithm is demonstrated in the simulation of a rover operating in rough terrain with unknown coefficients of friction
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
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“This would produce a heuristic in the style of A [10] that would estimate the probability of successfully travelling from start to goal through any particular node.”
BackgroundRandomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Cited by
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
LQG-MP: Optimized path planning for robots with motion uncertainty and imperfect state information
van den Berg, J., Abbeel, P., & Goldberg, K. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406562 · Cited by 395
Glaser, S., Vanholme, B., Mammar, S., Gruyer, D., & Nouveliere, L. (2010) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2010.2046037 · Cited by 336
Terrain traversability analysis methods for unmanned ground vehicles: A survey
Papadakis, P. (2013) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2013.01.006 · Cited by 298
Probabilistically safe motion planning to avoid dynamic obstacles with uncertain motion patterns
Aoude, G. S., Luders, B. D., Joseph, J. M., Roy, N., & How, J. P. (2013) · Autonomous Robots · doi:10.1007/s10514-013-9334-3 · Cited by 271
Terrain Adaptive Navigation for Planetary Rovers
Helmick, D., Angelova, A., & Matthies, L. (2009) · Journal of Field Robotics · doi:10.1002/rob.20292 · Cited by 103
“The use of forward simulation/modeling of the vehicle in planning has been done by (LaValle and Ku, 1999), (Melchior and Simmons, 2007), (Howard and Kelly, 2007), (Howard et al., 2008), however, the explicit use of stereo-generated terrain geometries, remotely learned terra-mechanical properties,…”
Method
Metadata
- Authors
- Melchior, N. A., & Simmons, R.
- Venue
- Proceedings 2007 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2007-04
- Pages
- 1617-1624
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2145432448
- Cited by
- 229
- References
- 2
- FWCI
- 8.76
- 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
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.