Self-Collision Detection and Prevention for Humanoid Robots James Kuffner et al. presented by Jinsung Kwon.

Slides:



Advertisements
Similar presentations
Friedhelm Meyer auf der Heide 1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Energy-Efficient Local Strategies for Robotic.
Advertisements

Everything you ever wanted to know about collision detection
NUS CS5247 Motion Planning for Car- like Robots using a Probabilistic Learning Approach --P. Svestka, M.H. Overmars. Int. J. Robotics Research, 16: ,
CSE 681 Bounding Volumes. CSE 681 Bounding Volumes Use simple volume enclose object(s) tradeoff for rays where there is extra intersection test for object.
Chapter 4.2 Collision Detection and Resolution. 2 Collision Detection Complicated for two reasons 1. Geometry is typically very complex, potentially requiring.
Collision Detection and Resolution Zhi Yuan Course: Introduction to Game Development 11/28/
Computational Geometry Definition and Application Areas.
The Vector Field Histogram Erick Tryzelaar November 14, 2001 Robotic Motion Planning A Method Developed by J. Borenstein and Y. Koren.
Probabilistic Roadmap
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Dynamic Maintenance and Self-Collision Testing for Large Kinematic.
Comparing Images Using the Hausdorff Distance Mark Bouts 6th April 2006.
Footstep Planning Among Obstacles for Biped Robots James Kuffner et al. presented by Jinsung Kwon.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Collision Detection and Distance Computation: Feature Tracking Methods.
1 Last lecture  Path planning for a moving Visibility graph Cell decomposition Potential field  Geometric preliminaries Implementing geometric primitives.
Motion Planning for Camera Movements in Virtual Environments Authors: D. Nieuwenhuisen, M. Overmars Presenter: David Camarillo.
Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Presented by David Camarillo.
Adaptive Dynamic Collision Checking for Many Moving Bodies Mitul Saha Department of Computer Science, Stanford University. NSF-ITR Workshop Collaborators:
UNC Chapel Hill M. C. Lin References Collision Detection between Geometric Models: A Survey, by M. Lin and S. Gottschalk, Proc. of IMA Conference on Mathematics.
Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Jinwhan Kim.
1 Geometry A line in 3D space is represented by  S is a point on the line, and V is the direction along which the line runs  Any point P on the line.
Adapted from: CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Naga K. Govindaraju, Stephane.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation: Feature Tracking Methods.
Oct 26, Fall 2006IAT 4101 Collision Detection. Oct 26, Fall 2006IAT 4102 Collision Detection  Essential for many games –Shooting –Kicking, punching,
Exact Collision Checking of Robot Paths Fabian Schwarzer Mitul Saha Jean-Claude Latombe Computer Science Department Stanford University.
Laboratory for Perceptual Robotics – Department of Computer Science Whole-Body Collision-Free Motion Planning Brendan Burns Laboratory for Perceptual Robotics.
Convex Hull Algorithms for Dynamic Data Kanat Tangwongsan Joint work with Guy Blelloch and Umut Acar (TTI-C)
Dynamic Maintenance and Self Collision Testing for Large Kinematic Chains Lotan, Schwarzer, Halperin, Latombe.
Planning for Humanoid Robots Presented by Irena Pashchenko CS326a, Winter 2004.
Presented By: Huy Nguyen Kevin Hufford
Adaptive Dynamic Collision Checking for Single and Multiple Articulated Robots in Complex Environments Schwarzer, Saha, and Latombe CS326A Winter 2004,
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.
Algorithm for Fast MC Simulation of Proteins Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.
NUS CS 5247 David Hsu Minkowski Sum Gokul Varadhan.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Oct 3, Fall 2005Game Design1 Collision Detection.
The University of North Carolina at CHAPEL HILL A Simple Path Non-Existence Algorithm using C-obstacle Query Liang-Jun Zhang.
CS 326 A: Motion Planning Collision Detection and Distance Computation.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
Efficient Maintenance and Self-Collision Testing for Kinematic Chains Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.
CSE53111 Computational Geometry TOPICS q Preliminaries q Point in a Polygon q Polygon Construction q Convex Hulls Further Reading.
CSE 381 – Advanced Game Programming Quickhull and GJK.
Robotics Chapter 5 – Path and Trajectory Planning
GRAVIR / IMAG, Grenoble, FRANCE A joint lab of CNRS, INPG, INRIA and UJF June 12, 2003IS4TM, Juan-Les-Pins, FRANCE Real-time Simulation of Self-Collisions.
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.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
Collision and Proximity Queries Dinesh Manocha Department of Computer Science University of North Carolina
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
Minimum Distance between curved surfaces Li Yajuan Oct.25,2006.
Non-Holonomic Motion Planning. Probabilistic Roadmaps What if omnidirectional motion in C-space is not permitted?
NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.
Tree-Growing Sample-Based Motion Planning
Algorithm for computing positive α-hull for a set of planar closed curves Vishwanath A. Venkataraman, Ramanathan Muthuganapathy Advanced Geometric Computing.
Essential Geometry. Equations Implicit – F(x,y) = 0 Parametric – P(t) = x – Q(t) = y – 0
Interactive Continuous Collision Detection for Polygon Soups Xin Huang 11/20/2007.
A Fast Algorithm for Incremental Distance Calculation Ming C. Lin & John Canny University of California, Berkeley 1991 Presentation by Adit Koolwal.
Department of Computer Science Columbia University rax Dynamically-Stable Motion Planning for Humanoid Robots Paper Presentation James J. Kuffner,
Honors Track: Competitive Programming & Problem Solving Seminar Topics Kevin Verbeek.
Minkowski Sums and Distance Computation Eric Larsen COMP
9/30/20161 Path Planning Cognitive Robotics David S. Touretzky & Ethan Tira-Thompson Carnegie Mellon Spring 2012.
COMPUTER GRAPHICS CHAPTER 35 CS 482 – Fall 2017 ANIMATION
C-obstacle Query Computation for Motion Planning
Faster Sample-based Motion Planning using Instance-based Learning
Kinetic Collision Detection for Convex Fat Objects
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Chapter 4 . Trajectory planning and Inverse kinematics
GPAT – Chapter 7 Physics.
Presentation transcript:

Self-Collision Detection and Prevention for Humanoid Robots James Kuffner et al. presented by Jinsung Kwon

Self-Collision Mobile Robots are free of self-collisions in most cases

Self-Collision Ariticulated robots are typically at high risk of self-collision

Objective Develop efficient geometric method detect and prevent self-collision detect and prevent self-collision suitable for complex articulated robots suitable for complex articulated robots H7 Humanoid (31 Links)

Challenges Large number of distance computations in short time N = 31 P = 435

Challenges Single distance computation itself is also very expensive

Strategies Eliminate unnecessary pairs from distance computation

Strategies

Strategies Protective Hulls approximation to the complicated geometry

Strategies Protective Hulls

Implementation Trajectory Sampling : discretization of the trajectory into a finite set of samples : discretization of the trajectory into a finite set of samples

Implementation Velocity Bounds and Collision-free Guarantees d min x max No Collision if x max < d min during ∆t with dx = J dq |dq/dt| < (dq/dt) max

Implementation Voronoi-clip for distance computation Running time depends on the geometric complexity and posture changed Running time depends on the geometric complexity and posture changed Running relatively in constant time with high coherency Running relatively in constant time with high coherency Limited to convex polyhedrons Limited to convex polyhedrons

Implementation Control Strategy Read joystick command Calculate 3-step trajectory Check new trajectory for self-collision Final Posture by Emergency Stop

Results

Results

Results Comparison

Future Work Automatic selection of active pairs for given joint angle ranges Automatic selection of active pairs for given joint angle ranges Alternative minimum distance determination method allowing non-convex protective hulls Alternative minimum distance determination method allowing non-convex protective hulls