Efficient Motion Planning Based on Disassembly
نویسندگان
چکیده
Disassembly-based motion planning (DBMP) is a novel and efficient single-query, sampling-based motion planning approach for free-flying robots. Disassembly-based motion planning uses workspace information to determine the workspace volume of a potential solution path and uses this information to exclude large portions of configuration space from exploration. It also identifies the most constrained placements of the robot along the potential solution path. These placements are referred to as assemblies because they are highly constrained by the environment, much like parts in an assembly are constrained. The constraints limit the possible motions of the robot and thus can be exploited to further limit configuration space exploration. The use of these two sources of workspace information permits the solution of many practical problems with very limited configuration space exploration. This reduction in configuration space exploration results in performance improvements of several orders of magnitude, compared to state-of-the-art motion planning methods. For non-free-flying robots, disassembly-based motion planning performs at least as well as the sampling-based motion planning method it is based on.
منابع مشابه
D-Plan: Efficient Collision-Free Path Computation for Part Removal and Disassembly
We present a novel approach to compute a collision-free path for part disassembly simulation and virtual prototyping of part removal. Our algorithm is based on sample-based motion planning that connects collision-free samples in the configuration space using local planning. In order to effectively handle the tight-fitting scenarios, we describe techniques to generate samples in narrow passages ...
متن کاملViewing Motion Planning as Disassembly: A Decomposition-Based Approach for Non-Stationary Robots
An efficient single-query motion planning approach for non-stationary robots is presented. The approach exploits workspace information to identify highly constrained placements of the robot along a potential solution path. Due to the constraints imposed by the environment at these placements, we view them as an assembly, consisting of the robot and the environment. The original motion planning ...
متن کاملDisassembly Path Planning for Objects with Articulated Parts
Sampling-based path planning algorithms are powerful tools for computing disassembly motions. This paper presents a variant of the RRT algorithm particularly devised for the disassembly of objects with articulated parts. Configuration parameters generally play two different roles in this type of problems: some of them are essential for the disassembly task, while others only need to move if the...
متن کاملPath-planning techniques for the simulation of disassembly tasks
Purpose – This paper aims to develop path-planning techniques that support a general selective disassembly planner in a virtual reality environment. Design/methodology/approach – The paper presents an automatic selective disassembly planning and two path-planning techniques that support it. The first one is based on single translations, while the second is based on the generation of a random se...
متن کاملEfficient Motion Planning using Generalized Penetration Depth Computation
Liangjun Zhang: Efficient Motion Planning using Generalized Penetration Depth Computation. (Under the direction of Dinesh Manocha.) Motion planning is a fundamental problem in robotics and also arises in other applications including virtual prototyping, navigation, animation and computational structural biology. It has been extensively studied for more than three decades, though most practical ...
متن کامل