Uploaded May 2018 | Updated September 2026, 2 weeks ago
ICRA 2018 Spotlight Video
Interactive Session Tue AM Pod D.3
Authors: Matsuno, Takayuki; Shirakawa, Tomoya; Watanabe, Tomotoshi; Minami, Mamoru
Title: String Untying Planning Based on Knot Theory and Proposal of Algorithms to Generate the Motion of a Manipulator
Abstract:
Recently, the demand to manipulate deformable objects such as a string and cloth by robots is growing. The reason is that it has the possibility of making our lives more convenient in many domains such as housework, manufacturing and medical field. However, manipulation of deformable objects is more difficult than that of rigid objects, because deformable objects have diversity of shape and behavior. Therefore, our research group has been focusing on the string shape operation by a robot. This paper describes planning method of string untying operation based on knot theory and algorithms to generate the motion of a manipulator. The novel contribution of our planning method is automatic selection of optimal shape operation based on cost function. Reidemeister moves and Cross, which are units of shape operations defined in Knot Theory, are divided into several groups. Additionally, heuristic cost are set up. Our algorithms to generate the motion of a manipulator is a deterministic approach and do not include learning or teaching-playback. The advantages of our method are automatic robot motion generation and disuse of teacher data. At final, the result of string untying experiment is reported.
ICRA 2018 Spotlight Video
Interactive Session Tue AM Pod D.3
Authors: Matsuno, Takayuki; Shirakawa, Tomoya; Watanabe, Tomotoshi; Minami, Mamoru
Title: String Untying Planning Based on Knot Theory and Proposal of Algorithms to Generate the Motion of a Manipulator
Abstract:
Recently, the demand to manipulate deformable objects such as a string and cloth by robots is growing. The reason is that it has the possibility of making our lives more convenient in many domains such as housework, manufacturing and medical field. However, manipulation of deformable objects is more difficult than that of rigid objects, because deformable objects have diversity of shape and behavior. Therefore, our research group has been focusing on the string shape operation by a robot. This paper describes planning method of string untying operation based on knot theory and algorithms to generate the motion of a manipulator. The novel contribution of our planning method is automatic selection of optimal shape operation based on cost function. Reidemeister moves and Cross, which are units of shape operations defined in Knot Theory, are divided into several groups. Additionally, heuristic cost are set up. Our algorithms to generate the motion of a manipulator is a deterministic approach and do not include learning or teaching-playback. The advantages of our method are automatic robot motion generation and disuse of teacher data. At final, the result of string untying experiment is reported.





![On Bisection Continuous Collision Checking Method: Spherical Joints and Minimum Distance to Obstacle
ICRA 2018 Spotlight Video
Interactive Session Thu PM Pod R.3
Authors: TARBOURIECH, Sonny; Suleiman, Wael
Title: On Bisection Continuous Collision Checking Method: Spherical Joints and Minimum Distance to Obstacles
Abstract:
In this paper, we adapt the Continuous Collision Checking Detection (CCD) method proposed in [1] to efficiently handle the case of spherical and two revolute joints, this kind of joints is very common in modern robotic systems. The new formulations provide more tight motion bounds, thus increase the success rate of checking collision-free paths. We also propose an extension to get the minimum distance to obstacles along a path, this information is primordial as it allows sampling-based motion planning techniques to sort collision-free paths according to their minimum clearance. We have integrated our implementation into a sampling-based motion planning technique and validated it through simulation and on the real Baxter research robot. The experiments revealed that the method not only does not miss any collision between the robot and the obstacles, but also the minimum distance extension provides the path with the maximum clearance at no additional computational cost. On Bisection Continuous Collision Checking Method: Spherical Joints and Minimum Distance to Obstacle](https://i.ytimg.com/vi/XYwj53x-35E/mqdefault.jpg)




