The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
MOD-RRT*: A Sampling-Based Algorithm for Robot Path Planning in Dynamic Environment
Abstract
This article presents an algorithm termed as multiobjective dynamic rapidly exploring random (MOD-RRT*), which is suitable for robot navigation in unknown dynamic environment. The algorithm is composed of a path generation procedure and a path replanning one. First, a modified RRT* is utilized to obtain an initial path, as well as generate a state tree structure as prior knowledge. Then, a shortcuting method is given to optimize the initial path. On this basis, another method is designed to replan the path if the current path is infeasible. The suggested approach can choose the best node among several candidates within a short time, where both path length and path smoothness are considered. Comparing with other static planning algorithms, the MOD-RRT* can generate a higher quality initial path. Simulations on the dynamic environment are conducted to clarify the efficient performance of our algorithm in avoiding unknown obstacles. Furthermore, real applicative experiment further proves the effectiveness of our approach in practical applications.
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
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×
“2998740 Sampling-based algorithms, such as rapidly exploring random tree (RRT) [5] and probabilistic roadmap algorithm [6],”
MethodSampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
Rapidly-exploring random trees : a new tool for path planning
LaValle, S. M. (1998) · Cited by 3,704
Robot path planning in uncertain environment using multi-objective particle swarm optimization
Zhang, Y., Gong, D.-W., & Zhang, J.-H. (2013) · Neurocomputing · doi:10.1016/j.neucom.2012.09.019 · Cited by 406
Advanced perception, navigation and planning for autonomous in-water ship hull inspection
Hover, F. S., Eustice, R. M., Kim, A., Englot, B., Johannsson, H., Kaess, M., & Leonard, J. J. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912461059 · Cited by 249
THE PARETO PRINCIPLE: ITS USE AND ABUSE
Sanders, R. (1987) · Journal of Services Marketing · doi:10.1108/eb024706 · Cited by 239
Asymptotically Near-Optimal RRT for Fast, High-Quality Motion Planning
Salzman, O., & Halperin, D. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2539377 · Cited by 199
Chen, L., Shan, Y., Tian, W., Li, B., & Cao, D. (2018) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2018.2821767 · Cited by 178
Sampling-based optimal motion planning for non-holonomic dynamical systems
Karaman, S., & Frazzoli, E. (2013) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2013.6631297 · Cited by 165
MOD* Lite: An Incremental Path Planning Algorithm Taking Care of Multiple Objectives
Oral, T., & Polat, F. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2399616 · Cited by 67
Cited by
Path planning techniques for mobile robots: Review and prospect
Liu, L., Wang, X., Yang, X., Liu, H., Li, J., & Wang, P. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120254 · Cited by 707
Metadata
- Authors
- Qi, J., Yang, H., & Sun, H.
- Venue
- IEEE Transactions on Industrial Electronics
- Published
- 2021-08
- Volume
- 68
- Issue
- 8
- Pages
- 7244-7251
- ISSN
- 0278-0046 (ISSN-L)
- 1557-9948
- OpenAlex
- W3034726893
- Cited by
- 299
- References
- 11
- FWCI
- 11.20
- 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: MOD-RRT*: A Sampling-Based Algorithm for Robot Path Planning in Dynamic Environment. https://app.cochat.ai/papers/10.1109/tie.2020.2998740
- The paper
- Qi, J., Yang, H., & Sun, H. (2021). MOD-RRT*: A Sampling-Based Algorithm for Robot Path Planning in Dynamic Environment. IEEE Transactions on Industrial Electronics. https://doi.org/10.1109/tie.2020.2998740
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.