RewardRRT: Path Planning for Multi-Degree-of-Freedom Robots in Narrow Environments
A novel path planning algorithm, RewardRRT, is proposed to address the challenge of Multi-degree-of-freedom robot path planning in narrow environments. In this approach, RewardRRT conceptualizes the sampling tree of Rapidly-exploring Random Trees (RRT) as an agent, assigning a reward value function