Stable placements for spider robots

Authors:
J.-D. Boissonnat;O. Devillers;L. Donati;F. P. Preparata
Affiliations:
-;-;-;-
Venue:
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Year:
1992

Citing 4
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
A linear-time algorithm for computing the Voronoi diagram of a convex polygon

Discrete & Computational Geometry
Generalized standard foot trajectory for a quadruped walking vehicle

International Journal of Robotics Research
Offline maintenance of planar configurations

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of computing the set of admissible and stable placements of spider robots, a simple case of legged robots. The environment consists of a set of n points in the plane representing authorized footholds. We show that the space of admissible and stable placements of such robots has size &thgr;(n2) and can be constructed in O(n2 log n) time and O(n2) space. We give also efficient algorithms for several related problems.