Survey on model-based manipulation planning of deformable objects

A systematic overview on the subject of model-based manipulation planning of deformable objects is presented. Existing modelling techniques of volumetric, planar and linear deformable objects are described, emphasizing the different types of deformation. Planning strategies are categorized according to the type of manipulation goal: path planning, folding/unfolding, topology modifications and assembly. Most current contributions fit naturally into these categories, and thus the presented algorithms constitute an adequate basis for future developments.Preprin

Trajectory planning with task constraints in densely filled environments

In this paper the problem of computing a rigid object trajectory in an environment populated with deformable objects is addressed. The problem arises in Minimally Invasive Robotic Surgery (MIRS) from the needs of reaching a point of interest inside the anatomy with rigid laparoscopic instruments. We address the case of abdominal surgery. The abdomen is a densely populated soft environment and it is not possible to apply classical techniques for obstacle avoidance because a collision free solution is, most of the time, not feasible. In order to have a convergent algorithm with, at least, one possible solution we have to relax the constraints and allow collision under a specific contact threshold to avoid tissue damaging. In this work a new approach for trajectory planning under these peculiar conditions is implemented. The method computes offline the path which is then tested in a surgical simulator as part of a pre-operative surgical plan

Motion planning for cooperative manipulators folding flexible planar objects

Abstract — Research on robotic manipulation has mostly avoided the grasping of highly deformable objects, although they account for a significant portion of everyday grasping tasks. In this paper we address the problem of using cooperative manipulators for folding tasks of cloth-like deformable objects, from a motion planning perspective. We demonstrate that complex deformable object models are unnecessary for robotic applications. Consequently, a simple object model is exploited to create a new algorithm capable of generating collision-free folding motions for two cooperating manipulators. The algorithm encompasses the essential properties of manipulator-independence, parameterized fold quality, and speed. Numerous experiments executed on a real and simulated dual-manipulator robotic torso demonstrates the method’s effectiveness. I

CTopPRM: Clustering Topological PRM for Planning Multiple Distinct Paths in 3D Environments

In this paper, we propose a new method called Clustering Topological PRM (CTopPRM) for finding multiple homotopically distinct paths in 3D cluttered environments. Finding such distinct paths, e.g., going around an obstacle from a different side, is useful in many applications. Among others, using multiple distinct paths is necessary for optimization-based trajectory planners where found trajectories are restricted to only a single homotopy class of a given path. Distinct paths can also be used to guide sampling-based motion planning and thus increase the effectiveness of planning in environments with narrow passages. Graph-based representation called roadmap is a common representation for path planning and also for finding multiple distinct paths. However, challenging environments with multiple narrow passages require a densely sampled roadmap to capture the connectivity of the environment. Searching such a dense roadmap for multiple paths is computationally too expensive. Therefore, the majority of existing methods construct only a sparse roadmap which, however, struggles to find all distinct paths in challenging environments. To this end, we propose the CTopPRM which creates a sparse graph by clustering an initially sampled dense roadmap. Such a reduced roadmap allows fast identification of homotopically distinct paths captured in the dense roadmap. We show, that compared to the existing methods the CTopPRM improves the probability of finding all distinct paths by almost 20% in tested environments, during same run-time. The source code of our method is released as an open-source package.Comment: in IEEE Robotics and Automation Letter

A Grid-Based Motion Planning Approach for Coherent Groups

This paper presents a novel motion planning approach for coherent groups with constant area, and it integrates C-L method into the probabilistic roadmap algorithm with sampling on the medial axis (MAPRM). In the preprocessing phase, the group is discretized into a grid-set which represents the configuration of the group. Then, a number of samples are generated on workspace by medial axis technique. These samples are extended into group’s configuration nodes of the roadmap using an extending strategy. Also, the group's deformation degree relative to the desired shape is introduced to improve the evaluation function. It gives users more flexibility to determine the respective weights of the group’s deformation degree and its distance to the goal in the query phase. After that, a novel local planner is constructed to connect any two neighbor configurations by using C-L method and the improved evaluation function. Experiments show that our approach is able to find paths for the coherent group efficiently and keep its area invariant when moving toward the goal