Results 1 to 10 of about 33,025 (207)
Fast-RRT: A RRT-Based Optimal Path Finding Method [PDF]
Applied Sciences (Switzerland), 2021 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 quickly.
Zhijun Meng, Zhe Wu, Wu Zhenping
exaly +4 more sources
RRT*-SMART: A Rapid Convergence Implementation of RRT* [PDF]
International Journal of Advanced Robotic Systems, 2013 Many sampling based algorithms have been introduced recently. Among them Rapidly Exploring Random Tree (RRT) is one of the quickest and the most efficient obstacle free path finding algorithm.
Jauwairia Nasir +6 more
doaj +2 more sources
Path planning for manipulators based on the planar constraint RRT* algorithm [PDF]
Scientific ReportsPath planning is crucial for automatic measurement to ensure a collision-free process for manipulators. However, the more complex the measurement environment, the more complex the path planning scheme is often required in order to meet the above ...
Minyue Li +4 more
doaj +2 more sources
Accelerating RRT* convergence with novel nonuniform and uniform sampling approach
Scientific ReportsPath planning plays a crucial role in autonomous mobile robotics. Sampling-based path planners are widely and frequently employed to generate collision-free paths between a start and goal location.
Balakrishnan Ramalingam +2 more
exaly +2 more sources
Massively parallelizing the RRT and the RRT [PDF]
2011 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2011 In recent years, the growth of the computational power available in the Central Processing Units (CPUs) of consumer computers has tapered significantly. At the same time, growth in the computational power available in the Graphics Processing Units (GPUs) has remained strong.
Karaman, Sertac +2 more
openaire +3 more sources
2014 IEEE International Conference on Robotics and Automation (ICRA), 2014 n ...
Chonhyon Park +2 more
openaire +2 more sources
Blind RRT: A probabilistically complete distributed RRT [PDF]
2013 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2013 Rapidly-Exploring Random Trees (RRTs) have been successful at finding feasible solutions for many types of problems. With motion planning becoming more computationally demanding, we turn to parallel motion planning for efficient solutions. Existing work on distributed RRTs has been limited by the overhead that global communication requires.
Cesar Rodriguez +4 more
openaire +1 more source
Integrated Motion Planning for Assembly Task with Part Manipulation Using Re-Grasping
Applied Sciences, 2020 This paper presents an integrated planner based on rapidly exploring random tree (RRT) for an assembly task with possible re-grasping. Given multiple grasp poses for the part to assemble, the planner chooses candidate grasp poses considering the ...
Ahmad Ali, Ji Yeong Lee
doaj +1 more source
RRT and RRT* Using Vehicle Dynamics
CoRR, 2022 The trajectory derived from RRT and RRT* is zagged. A holonomic drive is able to follow this trajectory. But real-life vehicle which has dynamical constraints cannot follow this trajectory. In this work, we are going to modify the RRT and RRT* algorithm to generate a trajectory that a vehicle with dynamical constraint can follow.
openaire +2 more sources
NPQ‐RRT ∗: An Improved RRT ∗ Approach to Hybrid Path Planning [PDF]
Complexity, 2021 In recent years, the path planning of robot has been a hot research direction, and multirobot formation has practical application prospect in our life. This article proposes a hybrid path planning algorithm applied to robot formation. The improved Rapidly Exploring Random Trees algorithm PQ‐RRT ∗ with new distance evaluation function is used as a ...
Zihan Yu, Linying Xiang
openaire +2 more sources