Modeling & Planning Deniz Güven Needle Insertion.

Slides:



Advertisements
Similar presentations
Rapidly Exploring Random Trees Data structure/algorithm to facilitate path planning Developed by Steven M. La Valle (1998) Originally designed to handle.
Advertisements

Complete Motion Planning
Motion Planning for Point Robots CS 659 Kris Hauser.
Uniform circular motion – Another specific example of 2D motion
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
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.
Planning in surgery and surgical simulation Comp course presentation Mert Sedef.
EE631 Cooperating Autonomous Mobile Robots Lecture 5: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
The City College of New York 1 Prepared by Dr. Salah Talha Mobot: Mobile Robot Introduction to ROBOTICS.
Integrating FEM-based deformable obstacles in PRM Comp768 project presentation Mert Sedef.
Path-Finding with Motion Constraints Amongst Obstacles in Real Time Strategies By Jeremiah J. Shepherd Committee: Jijun Tang Roger Dougal Jason O’Kane.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
Rapidly Expanding Random Trees
CS 326A: Motion Planning Configuration Space. Motion Planning Framework Continuous representation (configuration space and related spaces + constraints)
Picking Up the Pieces: Grasp Planning via Decomposition Trees Corey Goldfeder, Peter K. Allen, Claire Lackner, Raphael Pelosoff.
Introduction to ROBOTICS
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Kinodynamic Planning and Navigation with Movable Obstacles.
CS 326 A: Motion Planning Exploring and Inspecting Environments.
Presented By: Huy Nguyen Kevin Hufford
Extended Potential Field Method Adam A. Gonthier MEAM 620 Final Project 3/19/2006.
Mobile Robotics: 11. Kinematics 2
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
NUS CS5247 Motion Planning for Humanoid Robots Presented by: Li Yunzhen.
Feedback Control for Steering Needles Through 3D Deformable Tissue Using Helical Paths Kris Hauser, Ron Alterovitz, Nuttapon Chentanez, Allison Okamura,
1 CMPUT 412 Motion Control – Wheeled robots Csaba Szepesvári University of Alberta TexPoint fonts used in EMF. Read the TexPoint manual before you delete.
Planning Curvature and Torsion Constrained Ribbons for Intracavitary Brachytherapy Sachin Patil, Jia Pan, Pieter Abbeel, Ken Goldberg UC Berkeley EECS.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty Changsi An You-Wei Cheah.
9/14/2015CS225B Kurt Konolige Locomotion of Wheeled Robots 3 wheels are sufficient and guarantee stability Differential drive (TurtleBot) Car drive (Ackerman.
Robot Crowd Navigation using Predictive Position Fields in the Potential Function Framework Ninad Pradhan, Timothy Burg, and Stan Birchfield Electrical.
Needle Steering Force Model and Trajectory Planning
Robotics Chapter 5 – Path and Trajectory Planning
Introduction to ROBOTICS
Beyond trial and error…. Establish mathematically how robot should move Kinematics: how robot will move given motor inputs Inverse-kinematics: how to.
Behrouz Haji Soleimani Dr. Moradi. Outline What is uncertainty? Some examples Solutions to uncertainty Ignoring uncertainty Markov Decision Process (MDP)
CS B659: Principles of Intelligent Robot Motion Configuration Space.
Wandering Standpoint Algorithm. Wandering Standpoint Algorithm for local path planning Description: –Local path planning algorithm. Required: –Local distance.
Conceptual Physics Notes on Chapter 9 CircularMotion.
yG7s#t=15 yG7s#t=15.
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.
Laboratory of mechatronics and robotics Institute of solid mechanics, mechatronics and biomechanics, BUT & Institute of Thermomechanics, CAS Mechatronics,
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Tree-Growing Sample-Based Motion Planning
City College of New York 1 John (Jizhong) Xiao Department of Electrical Engineering City College of New York Mobile Robot Control G3300:
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,
Basilio Bona DAUIN – Politecnico di Torino
James Irwin Amirkhosro Vosughi Mon 1-5pm
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
Rigid Needles, Steerable Needles, and Optimal Beam Algorithms Ovidiu Daescu Bio-Medical Computing Laboratory Department of Computer Science University.
Gaits Cost of Transportation Wheeled Mobile Robots Most popular locomotion mechanism Highly efficient Simple mechanical implementation Balancing is.
Finding Critical Changes in Dynamic Configuration Spaces Yanyan Lu and Jyh-Ming Lien George Mason University.
Rapidly-Exploring Random Trees
Instructor Prof. Shih-Chung Kang 2008 Spring
After completing this phase, you will be able to:
Zaid H. Rashid Supervisor Dr. Hassan M. Alwan
EE631 Cooperating Autonomous Mobile Robots Lecture: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Locomotion of Wheeled Robots
Team Members: Robert Muntean
Schematic representation of the milliDelta.
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Virtual Remote Center of Motion Control for Needle Placement Robots
Chapter 4 . Trajectory planning and Inverse kinematics
Experimental characterization of the milliDelta’s quasi-static workspace (yellow) compared with the theoretical workspace (blue) generated by the kinematic.
Planning.
Dual-stiffness origami gripper.
Presentation transcript:

Modeling & Planning Deniz Güven Needle Insertion

Outline Problem Definition Model Definition Path Planning Work Done – Needle Model Implementation – Path Planning Implementation Future Work & Contributions References Page 2/21

Problem Definition Needle insertion,one of the most widespread surgical techniques Critical aspect for many medical diagnoses, treatments Errors in needle targeting may reduce the effectiveness of diagnosis or treatment Targeting is challenging due to – lack of maneuverability in tissue, – limited vision – obstructions between the needle's entry point and the target Page 3/21

Problem Definition (cont'd) Kinematic models of needle steering are presented These models allow one to use many path planning techniques developed by the robotics community Judiciously chosen paths allows needles to – reach targets more accurately – reach small targets in locations that are inaccessible via straight trajectories Page 4/21

Model Definition The model is for a needle developed by Webster et al [1] with a rigid, homogeneous tissue Needle is a bevel-tip, flexible needle which bends while inserted into the tissue Fig.1. Bevel tip Page 5/21

Model Definition (cont'd) Bending is due to the asymmetric cutting forces arouse by bevel-tip asymmetry Fig.2a. Symmetric-tip needle cuts tissue in the direction that the tip is moving * Fig.2b. Bevel-tip needle cuts tissue at an angle * *Fig.2 is from [2] Page 6/21

Model Definition (cont'd) Bevel-tip needle is driven by two velocity inputs – insertion speed, – rotation speed actuated from the base of the needle Rotational input at the base causes needle to turn about its shaft Needle follows a circular arc with radius r = 1/k Fig.3.Bevel tip needle model* Page 7/21

Model Definition (cont'd) Fig.4. Single bend. Needle insertion is 23.5cm * Page 8/21

Model Definition (cont'd) Fig.5. Double bend, 8.3cm insertion– 180° spin – 16.7 cm insertion * * Fig.3, Fig.4 and Fig.5 are from [1] Page 9/21

Path Planning Rapidly-exploring Random Tree (RRT), an exploration algorithm to quickly search a workspace for possible paths Works efficiently with differential constraints and global constraints(obstacle boundaries and velocity bounds) Main Idea: – Initialize root of the tree with initial configuration – Incrementally grow the tree towards the unsearched area of the workspace by random sampling Page 10/21

Work Done: Model Implementation Rotation and insertion of the needle are not simultaneous Modeling is done in 2D Only two bevel rotations: – Bevel-right : 0 º – Bevel-left : 180 º Curvature k= with 95 % confidence interval of ± Page 11/21

Work Done: Model Implementation (cont'd) Fig.6. Single bend, bevel-right. Circular path is shown in blue dashes Page 12/21

Work Done: Model Implementation (cont'd) Fig.7. Double bend, Rotation changes from bevel-right to bevel left Page 13/21

Work Done: RRT Implementation Configuration: – bevel-rotation – tip angle – tip position Input: – Initial configuration of the needle – Target zone – Total number of trials to grow the tree Output: – Needle path with control parameters or null Page 14/21

Work Done: RRT Implementation (cont'd) Main Idea: – Root the tree at initial configuration – Grow the tree into free workspace until target is reached or total number of trials are reached Sampling: – Random samples from free space: 85% – Target zone and center: 10% and 5% Page 15/21

Work Done: RRT Implementation (cont'd) Demo 1 Page 16/21

Work Done: RRT Implementation (cont'd) Fig.7. Initial configuration (bevel-right,-30,(0,0) ) 9-bend path with bevel- rotations shown with red arrows Page 17/21

Work Done: RRT Implementation (cont'd) Demo 2 Page 18/21

Work Done: RRT Implementation (cont'd) Fig.8. Initial configuration (bevel-right,-30,(0,0) ) 5-bend path with bevel- rotations shown with red arrows Page 19/21

Future Work & Contributions Improvements for avoiding null outputs from RRT Periodic motion of the tissue Dynamic model for needle and tissue Homogeneous, soft tissue Page 20/21

References [1] R. J. Webster III, N. J. Cowan, G. Chirikjian, and A. M. Okamura. Nonholonomic modeling of needle steering. In Proceedings of 9 th International Symposium on Experimental Robotics, [2] Ron Alterovitz and Allison M. Okamura Ken Goldberg. Planning for steer-able bevel-tip needle insertion through 2d soft tissue with obstacles. In in Proc. IEEE Int. Conf. on Robotics and Automation, Page 21/21

Questions?