Certified Polyhedral Decompositions of Collision-Free Configuration Space

by   Hongkai Dai, et al.

Understanding the geometry of collision-free configuration space (C-free) in the presence of task-space obstacles is an essential ingredient for collision-free motion planning. While it is possible to check for collisions at a point using standard algorithms, to date no practical method exists for computing C-free regions with rigorous certificates due to the complexity of mapping task-space obstacles through the kinematics. In this work, we present the first to our knowledge rigorous method for approximately decomposing a rational parametrization of C-free into certified polyhedral regions. Our method, called C-IRIS (C-space Iterative Regional Inflation by Semidefinite programming), generates large, convex polytopes in a rational parameterization of the configuration space which are rigorously certified to be collision-free. Such regions have been shown to be useful for both optimization-based and randomized motion planning. Based on convex optimization, our method works in arbitrary dimensions, only makes assumptions about the convexity of the obstacles in the task space, and is fast enough to scale to realistic problems in manipulation. We demonstrate our algorithm's ability to fill a non-trivial amount of collision-free C-space in several 2-DOF examples where the C-space can be visualized, as well as the scalability of our algorithm on a 7-DOF KUKA iiwa, a 6-DOF UR3e and 12-DOF bimanual manipulators. An implementation of our algorithm is open-sourced in Drake. We furthermore provide examples of our algorithm in interactive Python notebooks.


page 21

page 23

page 25

page 26

page 27

page 28


Finding and Optimizing Certified, Collision-Free Regions in Configuration Space for Robot Manipulators

Configuration space (C-space) has played a central role in collision-fre...

Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming

One of the most difficult parts of motion planning in configuration spac...

PolyDepth: Real-time Penetration Depth Computation using Iterative Contact-Space Projection

We present a real-time algorithm that finds the Penetration Depth (PD) b...

Generating Large Convex Polytopes Directly on Point Clouds

In this paper, we present a method to efficiently generate large, free, ...

Co-generation of Collision-Free Shapes for Arbitrary One-Parametric Motion

Mechanical assemblies can exhibit complex relative motions, during which...

A Roadmap-Path Reshaping Algorithm for Real-Time Motion Planning

Real-time motion planning is a vital function of robotic systems. Differ...

Robotic Sculpting with Collision-free Motion Planning in Voxel Space

In this paper, we explore the task of robot sculpting. We propose a sear...

Please sign up or login with your details

Forgot password? Click here to reset