Suchergebnisse - "sampling-based algorithms"
-
1
Motion planning for robotics: A review for sampling-based planners
ISSN: 2667-3797Veröffentlicht: Elsevier B.V 01.03.2025Veröffentlicht in Biomimetic intelligence and robotics (01.03.2025)“… Recent advancements in robotics have transformed industries such as manufacturing, logistics, surgery, and planetary exploration. A key challenge is developing …”
Volltext
Journal Article -
2
PQ-RRT: An improved path planning algorithm for mobile robots
ISSN: 0957-4174, 1873-6793Veröffentlicht: New York Elsevier Ltd 15.08.2020Veröffentlicht in Expert systems with applications (15.08.2020)“… •Propose a sampling-based asymptotically optimal path planning algorithm.•The proposed algorithm guarantees a fast convergence rate.•Theoretical proof of …”
Volltext
Journal Article -
3
Quick-RRT: Triangular inequality-based implementation of RRT with improved initial solution and convergence rate
ISSN: 0957-4174, 1873-6793Veröffentlicht: New York Elsevier Ltd 01.06.2019Veröffentlicht in Expert systems with applications (01.06.2019)“… •Sampling-based algorithms are commonly used in motion planning problems.•The RRT* algorithm incrementally builds a tree of motion to find a solution.•Taking a …”
Volltext
Journal Article -
4
F-RRT: An improved path planning algorithm with improved initial solution and convergence rate
ISSN: 0957-4174, 1873-6793Veröffentlicht: New York Elsevier Ltd 01.12.2021Veröffentlicht in Expert systems with applications (01.12.2021)“… •A tree-extending algorithm for reducing the solution cost is presented.•Generating nodes essential to the optimal path with smaller samples.•Searching for …”
Volltext
Journal Article -
5
Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments
ISSN: 0921-8890, 1872-793XVeröffentlicht: Elsevier B.V 01.06.2015Veröffentlicht in Robotics and autonomous systems (01.06.2015)“… The sampling-based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their …”
Volltext
Journal Article -
6
CCPF-RRT: An improved path planning algorithm with consideration of congestion
ISSN: 0957-4174, 1873-6793Veröffentlicht: Elsevier Ltd 15.10.2023Veröffentlicht in Expert systems with applications (15.10.2023)“… Path planning is essential for robots to efficiently execute jobs in challenging settings. In this paper, we propose a new algorithm, called potential …”
Volltext
Journal Article -
7
Density gradient-RRT: An improved rapidly exploring random tree algorithm for UAV path planning
ISSN: 0957-4174, 1873-6793Veröffentlicht: Elsevier Ltd 15.10.2024Veröffentlicht in Expert systems with applications (15.10.2024)“… In-depth studies of algorithms for solving motion planning problems have been conducted due to the rapid popularization and development of unmanned aerial …”
Volltext
Journal Article -
8
Informed scenario-based RRT∗ for aircraft trajectory planning under ensemble forecasting of thunderstorms
ISSN: 0968-090X, 1879-2359Veröffentlicht: Elsevier Ltd 01.08.2021Veröffentlicht in Transportation research. Part C, Emerging technologies (01.08.2021)“… Thunderstorms represent a major hazard for flights, as they compromise the safety of both the airframe and the passengers. To address trajectory planning under …”
Volltext
Journal Article -
9
Classified-RRT: Node classification RRT-based algorithm with improved solution performance and convergence rate
ISSN: 0957-4174Veröffentlicht: Elsevier Ltd 15.01.2026Veröffentlicht in Expert systems with applications (15.01.2026)“… Path planning is essential for ensuring the safe and efficient operation of robots. Among various path planning algorithms, Rapidly-exploring Random Tree (RRT) …”
Volltext
Journal Article -
10
Neural Network Approximation Based Near-Optimal Motion Planning With Kinodynamic Constraints Using RRT
ISSN: 0278-0046, 1557-9948Veröffentlicht: New York IEEE 01.11.2018Veröffentlicht in IEEE transactions on industrial electronics (1982) (01.11.2018)“… In this paper, the problem of near-optimal motion planning for vehicles with nonlinear dynamics in a clustered environment is considered. Based on rapidly …”
Volltext
Journal Article -
11
Potential functions based sampling heuristic for optimal path planning
ISSN: 0929-5593, 1573-7527Veröffentlicht: New York Springer US 01.08.2016Veröffentlicht in Autonomous robots (01.08.2016)“… Rapidly-exploring Random Tree star (RRT*) is a recently proposed extension of Rapidly-exploring Random Tree (RRT) algorithm that provides a collision-free, …”
Volltext
Journal Article -
12
ATS-RRT: an improved RRT algorithm based on alternative paths and triangular area sampling
ISSN: 0169-1864, 1568-5535Veröffentlicht: Taylor & Francis 19.05.2023Veröffentlicht in Advanced robotics (19.05.2023)“… The Rapidly Exploring Random Tree Star (RRT*) is a probabilistically complete algorithm. It is recognized as a better path planning algorithm, but its path …”
Volltext
Journal Article -
13
CDRT-RRT: Real-time rapidly exploring Random Tree Star based on convex dissection
ISSN: 0957-4174Veröffentlicht: Elsevier Ltd 05.04.2025Veröffentlicht in Expert systems with applications (05.04.2025)“… This study presents CDRT-RRT*, an algorithm for rapid real-time path planning in N-dimensional Euclidean spaces, based on convex dissection. CDRT-RRT* …”
Volltext
Journal Article -
14
Cyl-IRRT: Homotopy Optimal 3D Path Planning for AUVs by Biasing the Sampling Into a Cylindrical Informed Subset
ISSN: 0278-0046, 1557-9948Veröffentlicht: New York IEEE 01.04.2023Veröffentlicht in IEEE transactions on industrial electronics (1982) (01.04.2023)“… In a complex 3-D environment, efficiently and safely reaching the target position is of great significance for autonomous underwater vehicles. This article …”
Volltext
Journal Article -
15
SOF-RRT: An improved path planning algorithm using spatial offset sampling
ISSN: 0952-1976Veröffentlicht: 01.11.2023Veröffentlicht in Engineering applications of artificial intelligence (01.11.2023)Volltext
Journal Article -
16
HB-RRT:A path planning algorithm for mobile robots using Halton sequence-based rapidly-exploring random tree
ISSN: 0952-1976, 1873-6769Veröffentlicht: Elsevier Ltd 01.07.2024Veröffentlicht in Engineering applications of artificial intelligence (01.07.2024)“… Path planning remains crucial for efficient robot operation. A Halton Biased Rapidly-exploring Random Tree (HB-RRT) path planning algorithm is introduced in …”
Volltext
Journal Article -
17
FHQ-RRT: An Improved Path Planning Algorithm for Mobile Robots to Acquire High-Quality Paths Faster
ISSN: 1424-8220, 1424-8220Veröffentlicht: Switzerland MDPI AG 30.03.2025Veröffentlicht in Sensors (Basel, Switzerland) (30.03.2025)“… The Rapidly-exploring Random Tree Star (RRT*) algorithm, widely utilized for path planning, faces challenges, such as slow acquisition of feasible paths and …”
Volltext
Journal Article -
18
An Overview and Comparison of Traditional Motion Planning Based on Rapidly Exploring Random Trees
ISSN: 1424-8220, 1424-8220Veröffentlicht: Switzerland MDPI AG 26.03.2025Veröffentlicht in Sensors (Basel, Switzerland) (26.03.2025)“… Motion planning is a fundamental problem in robotics that involves determining feasible or optimal paths within finite time. While complete motion planning …”
Volltext
Journal Article -
19
An adaptive bidirectional quick optimal Rapidly-exploring Random Tree algorithm for path planning
ISSN: 0952-1976, 1873-6769Veröffentlicht: Elsevier Ltd 01.09.2024Veröffentlicht in Engineering applications of artificial intelligence (01.09.2024)“… In recent decades, sampling-based algorithms have played an important role in path planning. As an extended algorithm of Rapidly-exploring Random Tree(RRT), …”
Volltext
Journal Article -
20
QS ‐ RRT : An Improved Path Planning Algorithm with Goal‐Biased Strategy
ISSN: 1931-4973, 1931-4981Veröffentlicht: 31.10.2025Veröffentlicht in IEEJ transactions on electrical and electronic engineering (31.10.2025)“… The rapidly‐exploring Random Tree (RRT) algorithm, based on sampling, is a popular algorithm for path planning problems. The optimal RRT (RRT*) is an extension …”
Volltext
Journal Article