Rapid motion planning of manipulator in three-dimensional space under multiple scenes

Most working scenes of industrial robots are static scenes and from a previous static scene to a current static scene is a multi-scene. Finding optimal paths with limited time is difficult for motion planning in a high-dimensional space or in multiple scenes. The low efficiency of motion planning of rapidly-exploring random tree star in high-dimensional spaces, low adaptability of global replanning to multiple scenes are addressed by proposing the local replanning based on goal dynamically-guiding rapidly-exploring random tree star (LR-GD-RRT*). The algorithm contributes to fast path tree exploration and multi-scene motion planning. For path tree exploration, sampling points heuristically generating and new nodes growth by goal dynamically-guiding are proposed to reduce the blind and ineffective searches. Moreover, dynamic adjustment of size of new node neighborhood according to density of the obstacles is proposed to search for more neighbor nodes to optimize the path and also to reduce ineffective computation to improve efficiency. For multi-scene, three steps of trimming, re-exploration, and reconnection for local replanning are proposed. For path tree exploration, simulations in 2D plane, 3D space, and the manipulator show that GD-RRT* improves convergence speed, shortens path length and search time, compared with RRT*. For multi-scene, simulations in 3D space and with the manipulator show that the local replanning of the current scene has both lower path cost and higher planning efficiency compared with the global replanning of the previous scene. Motion of the six-degree-of-freedom robot end in a real scene also verifies the effectiveness of the LR-GD-RRT*.