The complexity of robot motion planning
The complexity of robot motion planning
Robot Motion Planning
Planning Algorithms
A global motion planner that learns from experience for autonomous mobile robots
Robotics and Computer-Integrated Manufacturing
Hi-index | 0.00 |
Though path planning methods based on rolling windows have been successfully applied to planet rover in uncertain environment, the efficiency still remains unsatisfactory due to the single-step advancement strategy. In this paper, a novel path planning approach called Rapidly-exploring Random Tree (RRT) is introduced to efficiently find local feasible paths in the region of rolling windows. The planning step-size in each rolling window can be adaptive adjusted according to the local environment it's moving in, which is recorded by historical information perceived by the sensors. Combined with the goal-oriented heuristic strategy, the global collision-free solution path can be generated by successively connecting the local feasible paths. A number of infield experiments demonstrate the effectiveness of the proposed method.