Motion planning of legged robots: the spider robot problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 1995

Motion planning of legged robots: the spider robot problem

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 Θ(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.
No file

Dates and versions

hal-00795083 , version 1 (27-02-2013)

Identifiers

Cite

Jean-Daniel Boissonnat, Olivier Devillers, Leonbattista Donati, Franco P. Preparata. Motion planning of legged robots: the spider robot problem. International Journal of Computational Geometry and Applications, 1995, 5 (1), pp.3-20. ⟨10.1142/S0218195995000027⟩. ⟨hal-00795083⟩
84 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More