Neural RRT*: Learning-based optimal path planning
Rapidly random-exploring tree (RRT) and its variants are very popular due to their ability to
quickly and efficiently explore the state space. However, they suffer sensitivity to the initial …
quickly and efficiently explore the state space. However, they suffer sensitivity to the initial …
A generalized Voronoi diagram-based efficient heuristic path planning method for RRTs in mobile robots
The rapidly exploring random tree and its variants (RRTs) have been widely adopted as the
motion planning algorithms for mobile robots. However, the trap space problem, such as …
motion planning algorithms for mobile robots. However, the trap space problem, such as …
Kinematic Constrained Bi-directional RRT with Efficient Branch Pruning for robot path planning
In this paper, we present a novel path planning algorithm called Kinematic Constrained Bi-
directional Rapidly-exploring Random Tree with Efficient Branch Pruning (KB-RRT*), which …
directional Rapidly-exploring Random Tree with Efficient Branch Pruning (KB-RRT*), which …
EB-RRT: Optimal motion planning for mobile robots
In a human-robot coexisting environment, it is pivotal for a mobile service robot to arrive at
the goal position safely and efficiently. In this article, an elastic band-based rapidly exploring …
the goal position safely and efficiently. In this article, an elastic band-based rapidly exploring …
GMR-RRT*: Sampling-based path planning using gaussian mixture regression
Mobile robot autonomous path planning is an essential factor for its wide deployment in real-
world applications. Conventional sampling-based algorithms have gained tremendous …
world applications. Conventional sampling-based algorithms have gained tremendous …
Optimal path planning using generalized voronoi graph and multiple potential functions
In this article, we present a novel nonuniform sampling technique, based on the pipeline of
rapidly exploring random tree (RRT), for efficiently computing high-quality collision-free …
rapidly exploring random tree (RRT), for efficiently computing high-quality collision-free …
Fast-RRT: A RRT-based optimal path finding method
Z Wu, Z Meng, W Zhao, Z Wu - Applied sciences, 2021 - mdpi.com
As a sampling-based pathfinding algorithm, Rapidly Exploring Random Trees (RRT) has
been widely used in motion planning problems due to the ability to find a feasible path …
been widely used in motion planning problems due to the ability to find a feasible path …
Hybrid RRT: A semi-dual-tree RRT-based motion planner
Rapidly-exploring Random Trees (RRTs) have been widely used for motion planning
problems due to their ability to efficiently find solutions. Informed RRT* is an optimized …
problems due to their ability to efficiently find solutions. Informed RRT* is an optimized …
APF-IRRT*: An improved informed rapidly-exploring random trees-star algorithm by introducing artificial potential field method for mobile robot path planning
D Wu, L Wei, G Wang, L Tian, G Dai - Applied Sciences, 2022 - mdpi.com
An Informed RRT*(IRRT*) algorithm is one of the optimized versions of a Rapidly-exploring
Random Trees (RRT) algorithm which finds near-optimal solutions faster than RRT and …
Random Trees (RRT) algorithm which finds near-optimal solutions faster than RRT and …
Context-Aware Deep Reinforcement Learning for Autonomous Robotic Navigation in Unknown Area
Mapless navigation refers to a challenging task where a mobile robot must rapidly navigate
to a predefined destination using its partial knowledge of the environment, which is updated …
to a predefined destination using its partial knowledge of the environment, which is updated …