Computer Science – Computational Geometry
Scientific paper
1999-09-03
Computer Science
Computational Geometry
29 pages, 22 figures, prelininar results presented at WAFR94 and IEEE Robotics & Automation 94
Scientific paper
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body. 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). Moreover, the robot can only put its feet on some regions, called the foothold regions. The free space F is the set of positions of the body of the robot such that there exists a set of accessible footholds for which the robot is stable. We present an efficient algorithm that computes F in O(n2 log n) time using O(n2 alpha(n)) space for n discrete point footholds where alpha(n) is an extremely slowly growing function (alpha(n) <= 3 for any practical value of n). We also present an algorithm for computing F when the foothold regions are pairwise disjoint polygons with n edges in total. This algorithm computes F in O(n2 alpha8(n) log n) time using O(n2 alpha8(n)) space (alpha8(n) is also an extremely slowly growing function). These results are close to optimal since Omega(n2) is a lower bound for the size of F.
Boissonnat Jean-Daniel
Devillers Olivier
Lazard Sylvain
No associations
LandOfFree
Motion Planning of Legged Robots does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Motion Planning of Legged Robots, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Motion Planning of Legged Robots will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-543111