Toward Autonomous Free- Climbing Robots Tim Bretl, Jean-Claude Latombe, and Stephen Rock May 2003 Presented by Randall Schuh.

Slides:



Advertisements
Similar presentations
COMP Robotics: An Introduction
Advertisements

Complete Motion Planning
PRM and Multi-Space Planning Problems : How to handle many motion planning queries? Jean-Claude Latombe Computer Science Department Stanford University.
Manipulation Planning. In 1995 Alami, Laumond and T. Simeon proposed to solve the problem by building and searching a ‘manipulation graph’.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
Kinematics & Grasping Need to know: Representing mechanism geometry Standard configurations Degrees of freedom Grippers and graspability conditions Goal.
Presented By: Aninoy Mahapatra
Probabilistic Roadmap
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
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.
Multi-Robot Motion Planning Jur van den Berg. Outline Recap: Configuration Space for Single Robot Multiple Robots: Problem Definition Multiple Robots:
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.
“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Mathieu Bredif CS326A: Paper Review Winter 2004.
Presented by David Stavens. Manipulation Planning Before: Want to move the robot from one configuration to another, around obstacles. Now: Want to robot.
Motion Planning of Multi-Limbed Robots Subject to Equilibrium Constraints. Timothy Bretl Presented by Patrick Mihelich and Salik Syed.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
Grasping for Climbing Robots Teresa Miller Randy Schuh.
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 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
CS 326 A: Motion Planning and Under-Actuated Robots.
1 Motion Planning (It’s all in the discretization) R&N: Chap. 25 gives some background.
Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Presented by David Camarillo.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Sampling Strategies.
CS 326A: Motion Planning Jean-Claude Latombe CA: Aditya Mandayam.
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.
Motion Planning for Legged Robots on Varied Terrain Kris Hauser, Timothy Bretl, Jean-Claude Latombe Kensuke Harada, Brian Wilcox Presented By Derek Chan.
Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Presented by Mohammed Irfan Rafiq.
CS 326 A: Motion Planning Manipulation Planning.
Inverse Kinematics How do I put my hand here? IK: Choose these angles!
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.
Motion Algorithms: Planning, Simulating, Analyzing Motion of Physical Objects Jean-Claude Latombe Computer Science Department Stanford University.
1 Toward Autonomous Free-Climbing Robots Tim Bretl Jean-Claude Latombe Stephen Rock Special thanks to Eric Baumgartner, Brett Kennedy, and Hrand Aghazarian.
Integrated Grasp and Motion Planning For grasping an object in a cluttered environment several tasks need to take place: 1.Finding a collision free path.
CS 326 A: Motion Planning Kinodynamic Planning.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
MEE 3025 MECHANISMS WEEK 2 BASIC CONCEPTS. Mechanisms A group of rigid bodies connected to each other by rigid kinematic pairs (joints) to transmit force.
© Manfred Huber Autonomous Robots Robot Path Planning.
BIPEDAL LOCOMOTION Prima Parte Antonio D'Angelo.
DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Third Quarterly IPR Meeting May 11, 1999 P. I.s: Leonidas J. Guibas and Jean-Claude.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Collaborative Mobile Robots for High-Risk Urban Missions Report on Timeline, Activities, and Milestones P. I.s: Leonidas J. Guibas and Jean-Claude Latombe.
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.
COMP322/S2000/L281 Task Planning Three types of planning: l Gross Motion Planning concerns objects being moved from point A to point B without problems,
Multi-Agent Robotics George Birbilis PhD student
Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring
Introduction to Motion Planning
Outline: Introduction Solvability Manipulator subspace when n<6
NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.
Tree-Growing Sample-Based Motion Planning
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Department of Computer Science Columbia University rax Dynamically-Stable Motion Planning for Humanoid Robots Paper Presentation James J. Kuffner,
Motion Planning CS121 – Winter Basic Problem Are two given points connected by a path?
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Toward Autonomous Free-Climbing Robots
Mathematics & Path Planning for Autonomous Mobile Robots
Multi-Limb Robots on Irregular Terrain
Artificial Intelligence Lab
Presented By: Aninoy Mahapatra
Outline: Introduction Solvability Manipulator subspace when n<6
Motion Planning CS121 – Winter 2003 Motion Planning.
Chapter 4 . Trajectory planning and Inverse kinematics
Presentation transcript:

Toward Autonomous Free- Climbing Robots Tim Bretl, Jean-Claude Latombe, and Stephen Rock May 2003 Presented by Randall Schuh

Motivation Non-specific autonomous rock-climbing robots could benefit several applications: Non-specific autonomous rock-climbing robots could benefit several applications:  Search-and-rescue mountainous terrain mountainous terrain broken urban environments broken urban environments  Exploration Sub-surface environments Sub-surface environments Planetary, especially on Mars Planetary, especially on Mars  New modes of motion for humanoid robots

Previous Work Climbing robots Climbing robots  exploit unnatural surface properties, e.g.: Peg into hole Peg into hole Suction pads (grass, steel surfaces) Suction pads (grass, steel surfaces) Track and legged robots Track and legged robots  ascend slopes up to 50 degrees  Few works consider choosing foot placement Grasping Grasping  usually emphasizes force-closure

Planar Model 3 identical limbs, 8 dof 3 identical limbs, 8 dof Ignores self-collision Ignores self-collision Coulomb friction Coulomb friction Motion occurs in 4-D subspace of C-space Motion occurs in 4-D subspace of C-space

Planar Motion Planning One-Step-Climbing Problem One-Step-Climbing Problem Geometrical insight allows solution path planning in 2 dimensions (pelvis position) Geometrical insight allows solution path planning in 2 dimensions (pelvis position) Uses PRM techniques Uses PRM techniques  Instead of collisions, the planner tests for equilibrium Uses dynamic testing algorithm (Class 3) Uses dynamic testing algorithm (Class 3) Uses a simple smoothing technique Uses a simple smoothing technique

Coulomb friction cones F friction ≤ μ N F friction ≤ μ F cos θ Stable if: F sin θ < μ F cos θ Friction cone: tan φ ≤ μ φ ≤ tan –1 μ

E Dependent only on x Equilibrium Region += – + = 0 Dependent on x

Geometrical Analysis Free space of the free limb consists of 2 connected subsets Free space of the free limb consists of 2 connected subsets

Planar Example Planar Example1

Planar Example Planar Example2

Planar Example Planar Example3

Planar Example Planar Example4

Planar Example Planar Example5

Planar Example Planar Example6

Planar Example Planar Example7

Planar Example Planar Example8

Climbing up mountain (first 15 sec)

3D Model – LEMUR 1 II Each limb has a spherical shoulder and a revolute knee (4 dof); limbs are 30 cm long Each limb has a spherical shoulder and a revolute knee (4 dof); limbs are 30 cm long Joints are mechanically limited Joints are mechanically limited Robot can push or pull from each endpoint Robot can push or pull from each endpoint Motion occurs in 13-D subspace of C-space Motion occurs in 13-D subspace of C-space 1 Limbed Excursion Mobile Utility Robot – developed by JPL

3D Motion Planning Still tests for equilibrium Still tests for equilibrium Uses PQP to test for self-collisions and collisions with environment Uses PQP to test for self-collisions and collisions with environment Uses a more sophisticated technique for sampling closed kinematic chains Uses a more sophisticated technique for sampling closed kinematic chains Not yet reduced dimension of problem with geometrical analysis. Not yet reduced dimension of problem with geometrical analysis.

3D Example 3D Example1

3D Example 3D Example2

3D Example 3D Example3

3D Example 3D Example4

3D Example 3D Example5

3D Example 3D Example6

3D Example 3D Example7

3D Example 3D Example8

3D Example 3D Example9

Future Work Apply geometric insight to be able to capture narrow passages more efficiently Apply geometric insight to be able to capture narrow passages more efficiently Add torque constraints Add torque constraints Implement the algorithm on hardware, which will require Implement the algorithm on hardware, which will require  Visual and tactile sensing of grasps  Tactile feedback (slippage detection)  Multi-step planning based on incomplete information

Paper Comparison Common Features: Planning from a discrete series of grasps Planning from a discrete series of grasps Applying PRM techniques Applying PRM techniques Differences: Application to real vs. digital environment Application to real vs. digital environment Kinematic & equilibrium vs. kinematic constraints Kinematic & equilibrium vs. kinematic constraints