From Spider Robots to Half Disk Robots

We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached to the body. The robot can only put its feet on some regions, called the foothold regions. Moreover, the robot is subject to two constraints: Each leg has a maximal extension R (accessibility constraint) and the body of the robot must lie above the convex hull of its feet (stability constraint). We present an e cient algorithm to compute F. If the foothold regions are polygons with n edges in total, our algorithm computes F in O(n2 logn) time and O(n2 (n)) space where is the inverse of the Ackerman's function. (n2) is a lower bound for the size of F.

• Type: Conference
• Year: 1994
• Where: ICRA
• Authors: Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
• Keywords: Foothold Regions, ICRA 1994, Robot, Robotics, Spider Robot