HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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 of admissible and stable placements of such robots has size Q (n2) and can be constructed in O ( n2 log n) time and O (n2) space. Once has been constructed, we can efficiently solve several problems related to motion planning.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 11:49:37 AM
Last modification on : Friday, February 4, 2022 - 3:14:30 AM
Long-term archiving on: : Monday, April 5, 2010 - 9:30:02 PM


  • HAL Id : inria-00077007, version 1



Jean-Daniel Boissonnat, Olivier Devillers, Franco Preparata, Leonbattista Donati. Motion planning of legged robots : the spider robot problem. [Research Report] RR-1767, INRIA. 1992. ⟨inria-00077007⟩



Record views


Files downloads