This Article Full Text (PDF) Multimedia References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Similar articles in Web of Science Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Shapiro, A. Articles by Shoval, S. Search for Related Content Social Bookmarking                         What's this?

A Foothold Selection Algorithm for Spider Robot Locomotion in Planar Tunnel Environments

Department of Mechanical Engineering, Ben Gurion University of the Negeu, Israel ashapiro{at}bgu.ac.il

Elon Rimon

Department of Mechanical Engineering, Technion, Israel elon{at}robby.technion.ac.il

Shraga Shoval

Department of Industrial Engineering and Management, College of Judea and Samaria, Israel sharaga{at}yosh.ac.il

In this paper we present an algorithm, called the partitioned cubes gaiting (PCG) algorithm, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on three-limb robots, but the algorithm generalizes to robots with a larger number of limbs. The input to the PCG algorithm is a geometric description of the tunnel, a lower bound on the amount of friction at the contacts, as well as start and target foothold positions. Using efficient convex programming techniques, the algorithm approximates the possible foothold positions as a collection of cubes in contact configuration space (c-space). Each cube represents a contact independent set of feasible three-limb postures. A graph structure induced by the cubes has the property that its edges represent feasible motion between neighboring sets of three-limb postures. This motion is realized by lifting one limb while the other two limbs brace the robot against the tunnel walls. A shortest-path search along the graph yields a three–two–three gait pattern that moves the robot from start to target using a minimum number of foothold exchanges. In practical environments the algorithm runs in time, which is linear in the number of tunnel walls and polynomial in the degree of cube approximation of contact c-space. Simulations as well as experiments demonstrate the PCG algorithm in tunnel environments.

Key Words: multi-legged locomotion planning • gait planning • contact c-space

The International Journal of Robotics Research, Vol. 24, No. 10, 823-844 (2005)
DOI: 10.1177/0278364905058242


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?