Name
Abstract | ||
|---|---|---|
We consider the problem of planning motions of a simple legged robot called the spider robot. The robot is modelled as a point where all its legs are attached, and the footholds where the robot can securely place its feet consist of a set of n points in the plane. We show that the space F of admissible and stable placements of such robots has size Theta(n(2)) and can be constructed in O(n(2) log n) time and O(n(2)) space. Once F has been constructed, we can efficiently solve several problems related to motion planning. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1142/S0218195995000027 | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
Keywords | DocType | Volume |
SPIDER ROBOT, LEGGED ROBOT, MOTION PLANNING | Journal | 5 |
Issue | ISSN | Citations |
1-2 | 0218-1959 | 3 |
PageRank | References | Authors |
0.66 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Daniel Boissonnat | 1 | 2287 | 406.97 |
| Olivier Devillers | 2 | 184 | 23.75 |
| L. Donati | 3 | 8 | 1.25 |
| Franco P. Preparata | 4 | 2988 | 1267.82 |