ICRA 2016 Paper Abstract


Paper WeDbT2.5

Casarez, Carlos (University of California, Berkeley), Fearing, Ronald (University of California at Berkeley)

Step Climbing Cooperation Primitives for Legged Robots with a Reversible Connection

Scheduled for presentation during the Regular Session "Underactuated Devices and Robots" (WeDbT2), Wednesday, May 18, 2016, 15:52−15:55, Rm. A3

2016 IEEE International Conference on Robotics and Automation, May 16-21, 2016, Stockholm, Sweden

This information is tentative and subject to change. Compiled on June 6, 2020

Keywords Climbing robots, Multilegged Robots, Underactuated Robots


Cooperation primitives for climbing steps were developed for a system of two 10 cm long VelociRoACH hexapedal legged robots with a removable connection. When performed sequentially, the set of primitives allow the team of two robots to climb a step on the order of their body length. These primitives use a tether between the robots actuated by a winch on one of the robots to form and release connections, run synchronously while connected, and provide a tether assist force while running. For a step with a coefficient of friction of 1 and a height of 6.5 cm, quasi-static analysis correctly predicts that the two connected robots can raise the front robot over the top of the step, while a single robot can only pitch upward against the step. The winch module designed to perform the cooperative climbing experiments meets the system goals of providing controllable forces greater than each robot's body weight while driving a removable connection between the robots. Experiments demonstrate that the robot system can perform each cooperation primitive individually with a reliability of at least 50% using simple strategies of maintaining a constant bounding frequency with the drive motors of each robot and a set tether tension with the winch.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2020 PaperCept, Inc.
Page generated 2020-06-06  01:33:36 PST  Terms of use