1 Toward Autonomous Free-Climbing Robots Tim Bretl Jean-Claude Latombe Stephen Rock Special thanks to Eric Baumgartner, Brett Kennedy, and Hrand Aghazarian.

Slides:



Advertisements
Similar presentations
Principles of Biomechanics
Advertisements

Complete Motion Planning
Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
PRM and Multi-Space Planning Problems : How to handle many motion planning queries? Jean-Claude Latombe Computer Science Department Stanford University.
Visibility Graphs May Shmuel Wimer Bar-Ilan Univ., Eng. Faculty Technion, EE Faculty.
Communication Piazza – Code Angel Computers in Lab Joined late – Be sure to me to remind me!
4/15/2017 Using Gaussian Process Regression for Efficient Motion Planning in Environments with Deformable Objects Barbara Frank, Cyrill Stachniss, Nichola.
One of the most common types of drivetrain is known as a skid steer drivetrain, which may also be referred to as a tank drive. A skid steer drivetrain.
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
Randomized Kinodynamics Motion Planning with Moving Obstacles David Hsu, Robert Kindel, Jean-Claude Latombe, Stephen Rock.
Geometric Algorithms for Conformational Analysis of Long Protein Loops J. Cortess, T. Simeon, M. Remaud- Simeon, V. Tran.
Model Predictive Control for Humanoid Balance and Locomotion Benjamin Stephens Robotics Institute.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
1 On the Probabilistic Foundations of Probabilistic Roadmaps Jean-Claude Latombe Stanford University joint work with David Hsu and Hanna Kurniawati National.
Motion Planning of Multi-Limbed Robots Subject to Equilibrium Constraints. Timothy Bretl Presented by Patrick Mihelich and Salik Syed.
“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Eric Ng CS326A: Paper Review Spring 2003.
Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method Presented by: Deborah Meduna and Michael Vitus by: Saha, Latombe,
CS 326 A: Motion Planning Humanoid and Legged Robots.
1 Toward Autonomous Free-Climbing Robots Tim Bretl Jean-Claude Latombe Stephen Rock CS 326 Presentation Winter 2004 Christopher Allocco Special thanks.
1 Motion Planning (It’s all in the discretization) R&N: Chap. 25 gives some background.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Sampling Strategies.
1 On the Probabilistic Foundations of Probabilistic Roadmaps D. Hsu, J.C. Latombe, H. Kurniawati. On the Probabilistic Foundations of Probabilistic Roadmap.
1 Finding “Narrow Passages” with Probabilistic Roadmaps: The Small-Step Retraction Method Mitul Saha and Jean-Claude Latombe Research supported by NSF,
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Jean-Claude Latombe Computer Science Department Stanford University.
CS 326 A: Motion Planning Instructor: Jean-Claude Latombe Teaching Assistant: Itay Lotan Computer Science.
Laboratory for Perceptual Robotics – Department of Computer Science Whole-Body Collision-Free Motion Planning Brendan Burns Laboratory for Perceptual Robotics.
Motion Planning for Legged Robots on Varied Terrain Kris Hauser, Timothy Bretl, Jean-Claude Latombe Kensuke Harada, Brian Wilcox Presented By Derek Chan.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Primitive-Biased Sampling + Manipulation Planning.
Toward Autonomous Free- Climbing Robots Tim Bretl, Jean-Claude Latombe, and Stephen Rock May 2003 Presented by Randall Schuh.
Motion Algorithms: Planning, Simulating, Analyzing Motion of Physical Objects Jean-Claude Latombe Computer Science Department Stanford University.
Statics. Static Equilibrium  There are three conditions for static equilibrium. 1.The object is at rest 2.There is no net force 3.There is no net torque.
Statics. Static Equilibrium  There are three conditions for static equilibrium. 1.The object is at rest 2.There is no net force 3.There is no net torque.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
The University of North Carolina at CHAPEL HILL A Simple Path Non-Existence Algorithm using C-obstacle Query Liang-Jun Zhang.
Andre Seyfarth Hartmut Geyer Fumiya Iida Leg design and control of locomotion Zurich, 25 May 2004 Locomotion Lab Jena.
Lab 5: Damped simple harmonic motion
CS 326A: Motion Planning Probabilistic Roadmaps: Sampling and Connection Strategies.
Generalized Standard Foot Trajectory for a Quadruped Walking Vehicle (Shigeo Hirose, Osamu Kunieda ) Presentation: Guillaume Poncin.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
Chapter 7 Brady Dowds. Circular Motion An object that revolves about a single axis undergoes circular motion An object in circular motion has a centripetal.
Optimization-Based Full Body Control for the DARPA Robotics Challenge Siyuan Feng Mar
Non-Holonomic Motion Planning & Legged Locomotion.
Combined Task and Motion Planning for Mobile Manipulation Jason Wolfe, etc. University of California, Berkeley Mozi Song INFOTECH 1.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
3D Simulation of Human-like Walking and Stability Analysis for Bipedal Robot with Distributed Sole Force Sensors Authors : Chao SHI and Eric H. K. Fung.
Multi-Step Motion Planning for Free-Climbing Robots Tim Bretl, Sanjay Lall, Jean-Claude Latombe, Stephen Rock Presenter: You-Wei Cheah.
Manipulation Planning. Locomotion ~ Manipulation 2.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
8.2 Problems Involving Dry Friction
Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring
Introduction to Motion Planning
Dynamic Modeling of the Chariot Suspension System Joseph Shoer / ES6 Exit Presentation 7 August 2009.
Tree-Growing Sample-Based Motion Planning
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Rapidly-exploring.
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Progress Report - Solving optimal control problem Yoonsang Lee, Movement Research Lab., Seoul National University.
1 CS26N: Motion Planning for Robots, Digital Actors, and Other Moving Objects Jean-Claude Latombe ai.stanford.edu/~latombe/ Winter.
2/25-26 Obj: I can apply concepts of physics – energy, work, and efficiency--- to describe motion. What you should have in the ENB: Write down the first.
Physical Fitness. I. Heart and Lung Endurance II. Muscular Strength III. Muscular Endurance IV. Flexibility V. Body Composition.
Gaits Cost of Transportation Wheeled Mobile Robots Most popular locomotion mechanism Highly efficient Simple mechanical implementation Balancing is.
Motion Planning CS121 – Winter Basic Problem Are two given points connected by a path?
Toward Autonomous Free-Climbing Robots
Circular Motion.
Multi-Limb Robots on Irregular Terrain
Modeling Robot with n total limbs n-1 limbs on the ground
S3 vary load.
Sampling and Connection Strategies for Probabilistic Roadmaps
Dimitris Valeris Thijs Ratsma
Motion Planning CS121 – Winter 2003 Motion Planning.
Forces in Equilibrium Name: _______________
Presentation transcript:

1 Toward Autonomous Free-Climbing Robots Tim Bretl Jean-Claude Latombe Stephen Rock Special thanks to Eric Baumgartner, Brett Kennedy, and Hrand Aghazarian at the Planetary Robotics Lab, NASA-JPL

2 Goal Develop integrated control, planning, and sensing capabilities to enable a wide class of multi-limbed robots to climb steep natural terrain.

3 LEMUR IIb, Planetary Robotics Lab, NASA-JPL Generic vs. Specific Robot Generic Specific Sitti and Fearing, UC Berkeley

4 Previous Multi-Limbed Climbing Robots Each exploits a specific surface property NINJA II Hirose et al, 1991 Neubauer, 1994 Yim, PARC, 2002

5 Free Rock Climbing is about Natural Friction …

6 … and Non-Gaited Motion Gaited Non-Gaited

7 Overall, rock climbing is about how to apply strength, not about strength itself it is a problem-solving activity

8 Example System

9 Equilibrium Constraint Feasible positions of robot’s center of mass

10 Configuration Space For each combination of knee bends: –Position (x P,y P ) of pelvis –Joint angles (  1,  2 ) of free limb

11 Feasible Space 11 22   

12 1.Simple test for the feasibility of (x p,y p ) where… Feasible Space

13 1.Simple test for the feasibility of (x p,y p ) 2.Feasible (  1,  2 ) varying with (x p,y p ), in one half of  f where… ff Feasible Space

14 1.Simple test for the feasibility of (x p,y p ) 2.Feasible (  1,  2 ), varying with (x p,y p ), in one half of  f 3.Switching between halves of  f Feasible Space

15 Motion Planning Basic Approach (Probabilistic Roadmap) –Sample 4D configuration space –Check equilibrium condition –Check (self-)collision –Check torque limit Refined approach –Sample 2D pelvis space, lift to full 4D paths –Narrow passages are found in the 4D space

16 1.Achieve  2 =0 2.Move with  2 =0 3.Switch between halves of  f 4.Move with  2 =0 5.Move to goal

17 backstep highsteplieback

18 JPL’s LEMUR robot

19

20 Current Work  Terrain sensing and hold detection  Force control and slippage sensing  Uncertainty (hold location, limb positioning)  Motion optimization  Extension of feasible space analysis

21 What’s Next? Xtreme ironing

22 Xtreme ironing is one of the fastest-growing sports in the world

23