The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
RT-RRT*: a real-time path planning algorithm based on RRT*
Abstract
This paper presents a novel algorithm for real-time path-planning in a dynamic environment such as a computer game. We utilize a real-time sampling approach based on the Rapidly Exploring Random Tree (RRT) algorithm that has enjoyed wide success in robotics. More specifically, our algorithm is based on the RRT* and informed RRT* variants. We contribute by introducing an online tree rewiring strategy that allows the tree root to move with the agent without discarding previously sampled paths. Our method also does not have to wait for the tree to be fully built, as tree expansion and taking actions are interleaved. To our knowledge, this is the first real-time variant of RRT*.
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
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894 · cited 4×
“2005], potential field methods [Khatib 1986] and sampling methods like rapidly exploring random trees (RRTs) [LaValle 1998].”
MethodInfluentialProbabilistic 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 2×
“The path planning problem gets even more challenging when changing the goal point is allowed, which is the case in many multiple-query tasks [Kavraki et al. 1996], e.g. computer games.”
Background
Cited by
An Efficient Sampling-Based Method for Online Informative Path Planning in Unknown Environments
Schmid, L., Pantic, M., Khanna, R., Ott, L., Siegwart, R., & Nieto, J. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2969191 · Cited by 308
Metadata
- Authors
- Naderi, K., Rajamäki, J., & Hämäläinen, P.
- Venue
- Proceedings of the 8th ACM SIGGRAPH Conference on Motion in Games
- Publisher
- ACM
- Published
- 2015-11-16
- Pages
- 113-118
- OpenAlex
- W2294424735
- Cited by
- 162
- References
- 2
- FWCI
- 1.11
- 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: RT-RRT*: a real-time path planning algorithm based on RRT*. https://app.cochat.ai/papers/10.1145/2822013.2822036
- The paper
- Naderi, K., Rajamäki, J., & Hämäläinen, P. (2015). RT-RRT*: a real-time path planning algorithm based on RRT*. Proceedings of the 8th ACM SIGGRAPH Conference on Motion in Games. https://doi.org/10.1145/2822013.2822036
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.