A fast and adaptive test of static equilibrium for legged robots

Timothy Bretl, Sanjay Lall

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A legged robot walking on uneven terrain can avoid falling only by applying contact forces with its feet on the ground that compensate for gravity without causing slip. To plan safe motions, it is necessary to test this constraint at every posture explored at each set of foot placements. Since a huge number of postures may be explored, this test must be as fast as possible. Existing approaches either search explicitly for contact forces at each posture, or precompute the support polygon and check that the robot's center of mass lies above it. This paper presents a new algorithm that is faster than either existing approach. This algorithm is an incremental method of projection, that computes only enough of the support polygon to decide whether static equilibrium is possible at each posture. It takes advantage of information gained testing previous postures in order to test subsequent postures more quickly.

Original languageEnglish (US)
Title of host publicationProceedings 2006 IEEE International Conference on Robotics and Automation, ICRA 2006
Pages1109-1116
Number of pages8
DOIs
StatePublished - Dec 27 2006
Externally publishedYes
Event2006 IEEE International Conference on Robotics and Automation, ICRA 2006 - Orlando, FL, United States
Duration: May 15 2006May 19 2006

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
Volume2006
ISSN (Print)1050-4729

Other

Other2006 IEEE International Conference on Robotics and Automation, ICRA 2006
CountryUnited States
CityOrlando, FL
Period5/15/065/19/06

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A fast and adaptive test of static equilibrium for legged robots'. Together they form a unique fingerprint.

Cite this