Proceedings Article10.23919/CCC55666.2022.9902225
Robotic Path Planning Algorithm based on Ray Tracking and Diffuseness
Xiaoteng Wang,Yahui Gan,Fang Fang,Bo Zhou +3 more
- 25 Jul 2022
pp 3723-3729
1
TL;DR: A path planning algorithm based on ray tracking and diffuseness, named Ray Tracking & Illumination Algorithm, which searches for paths by simulating natural ray propagation and diffuse reflection, and uses redundant node removal and Bezier curve smoothing to improve the quality of the path is proposed.
read more
Abstract: This paper proposed a path planning algorithm based on ray tracking and diffuseness, named Ray Tracking & Illumination Algorithm, which searches for paths by simulating natural ray propagation and diffuse reflection, and uses redundant node removal and Bezier curve smoothing to improve the quality of the path. At the same time, in order to comprehensively evaluate the safety, length, smoothness and other indicators of a path, this paper puts forward the concept of “Motion Delay”, and evaluates the quality of the algorithm through the statistical motion delay of the path generated from many runs. Finally, a comparative test was conducted on the MATLAB platform with the A*, RRT, Informed RRT* and ABC-PSO algorithms. The results show that the generated path of RTI is smoother and safer. Especially, RTI is faster, more robust in the environment with U-shaped trap and less sensitive to the size of the map.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Manipulator path planning based on improved Informed RRT* and polynomial trajectory optimization
Hui Qi,Kunwei Li +1 more
- 21 Jul 2023
TL;DR: An improved seventh-polynomial optimized trajectory planning method has been adopted to effectively prevent the sudden change of the manipulator's joint angles and the motion path obtained by the improved polynomial trajectory optimization algorithm has been smoother, better in energy and with minimum impact, which can be well applied to manipulator motion planning.
1
References
Particle Swarm Optimization.
James Kennedy
- 01 Jan 2017
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
35K
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
12.7K
•Book
Probabilistic Robotics
Sebastian Thrun
- 01 Jan 2005
TL;DR: This research presents a novel approach to planning and navigation algorithms that exploit statistics gleaned from uncertain, imperfect real-world environments to guide robots toward their goals and around obstacles.
8.8K
•Journal Article
Rapidly-exploring random trees : a new tool for path planning
TL;DR: The Rapidly-exploring Random Tree (RRT) as discussed by the authors is a data structure designed for path planning problems with high degrees of freedom and non-holonomic constraints, including dynamics.
4.5K
Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic
Jonathan D. Gammell,Siddhartha S. Srinivasa,Timothy D. Barfoot +2 more
- 06 Nov 2014
TL;DR: Optimal RRTs (RRT*s) extend R RTs to the problem of finding the optimal solution, but in doing so asymptotically find the optimal path from the initial state to every state in the planning domain.