Reachable Distance Space: Efficient Sampling-Based Planning for Spatially Constrained Systems
نویسندگان
چکیده
Motion planning for spatially constrained robots is difficult due to additional constraints placed on the robot, such as closure constraints for closed chains or requirements on end-effector placement for articulated linkages. It is usually computationally too expensive to apply sampling-based planners to these problems since it is difficult to generate valid configurations. We overcome this challenge by redefining the robot’s degrees of freedom and constraints into a new set of parameters, called reachable distance space (RD-space), in which all configurations lie in the set of constraint-satisfying subspaces. This enables us to directly sample the constrained subspaces with complexity linear in the number of the robot’s degrees of freedom. In addition to supporting efficient sampling of configurations, we show that the RD-space formulation naturally supports planning and, in particular, we design a local planner suitable for use by sampling-based planners. We demonstrate the effectiveness and efficiency of our approach for several systems including closed chain planning with multiple loops, restricted end-effector sampling, and on-line planning for drawing/sculpting. We can sample single-loop closed chain systems The International Journal of Robotics Research Vol. 29, No. 7, June 2010, pp. 916–934 DOI: 10.1177/0278364909357643 c The Author(s), 2010. Reprints and permissions: http://www.sagepub.co.uk/journalsPermissions.nav Figures 1, 8–10, 12–17 appear in color online: http://ijr.sagepub.com with 1,000 links in time comparable to open chain sampling, and we can generate samples for 1,000-link multi-loop systems of varying topologies in less than a second. KEY WORDS—Motion Planning Sampling-Based Planners Closed Chain Systems Spatial Constraints.
منابع مشابه
Efficient Planning of Spatially Constrained Robot Using Reachable Distances
Motion planning for spatially constrained robots is particularly difficult due to additional constraints placed on the robot, such as closure constraints for closed chains or requirements on end effector placement for articulated linkages. In fact, for many spatially constrained systems, the probability that a randomly sampled robot configuration satisfies the additional constraints approaches ...
متن کاملPlanning with Reachable Distances
Motion planning for spatially constrained robots is difficult due to additional constraints placed on the robot, such as closure constraints for closed chains or requirements on end effector placement for articulated linkages. It is usually computationally too expensive to apply sampling-based planners to these problems since it is difficult to generate valid configurations. We overcome this ch...
متن کاملSampling Based Motion Planning with Reachable Volumes for High Degree of Freedom Manipulators
Motion planning for constrained systems is a version of the motion planning problem in which the motion of a robot is limited by constraints. For example, one can require that a humanoid robot such as a PR2 [45] remain upright by constraining its torso to be above its base or require that an object such as a bucket of water remain upright by constraining the vertices of the object to be paralle...
متن کاملSampling Based Motion Planning with Reachable Volumes
Motion planning for constrained systems is a version of the motion planning problem in which the motion of a robot is limited by constraints. For example, one can require that a humanoid robot such as a PR2 remain upright by constraining its torso to be above its base or require that an object such as a bucket of water remain upright by constraining the vertices of the object to be parallel to ...
متن کامل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 constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Robotics Res.
دوره 29 شماره
صفحات -
تاریخ انتشار 2010