Feedback Control for Steering Needles Through 3D Deformable Tissue Using Helical Paths Kris Hauser, Ron Alterovitz, Nuttapon Chentanez, Allison Okamura,

Slides:



Advertisements
Similar presentations
Car on an exit ramp a classic rotational motion & friction problem Rhine.
Advertisements

Lecture 7: Potential Fields and Model Predictive Control
From Kinematics to Arm Control a)Calibrating the Kinematics Model b)Arm Motion Selection c)Motor Torque Calculations for a Planetary Robot Arm CS36510.
Sensor Based Planners Bug algorithms.
Motion Planning for Point Robots CS 659 Kris Hauser.
CSE 380 – Computer Game Programming Pathfinding AI
VisHap: Guangqi Ye, Jason J. Corso, Gregory D. Hager, Allison M. Okamura Presented By: Adelle C. Knight Augmented Reality Combining Haptics and Vision.
Emilio Frazzoli, Munther A. Dahleh and Eric Feron Jingru Luo.
The Vector Field Histogram Erick Tryzelaar November 14, 2001 Robotic Motion Planning A Method Developed by J. Borenstein and Y. Koren.
Animation Following “Advanced Animation and Rendering Techniques” (chapter 15+16) By Agata Przybyszewska.
Continuous Collision Detection: Progress and Challenges Gino van den Bergen dtecta
Effectively Indexing Uncertain Moving Objects for Predictive Queries School of Computing National University of Singapore Department of Computer Science.
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
On Constrained Optimization Approach To Object Segmentation Chia Han, Xun Wang, Feng Gao, Zhigang Peng, Xiaokun Li, Lei He, William Wee Artificial Intelligence.
EE631 Cooperating Autonomous Mobile Robots Lecture 5: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
2-dimensional indexing structure
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
Motion Tracking. Image Processing and Computer Vision: 82 Introduction Finding how objects have moved in an image sequence Movement in space Movement.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
Footstep Planning Among Obstacles for Biped Robots James Kuffner et al. presented by Jinsung Kwon.
Multi video camera calibration and synchronization.
Bounding Volume Hierarchy “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presented by Mathieu Brédif.
LSRP: Local Stabilization in Shortest Path Routing Hongwei Zhang and Anish Arora Presented by Aviv Zohar.
CS 326A: Motion Planning Kynodynamic Planning + Dealing with Moving Obstacles + Dealing with Uncertainty + Dealing with Real-Time Issues.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
1 Landmark-Based Robot Navigation A. Lazanas, J.-C. Latombe Presented by Tim Bretl.
R-Trees 2-dimensional indexing structure. R-trees 2-dimensional version of the B-tree: B-tree of maximum degree 8; degree between 3 and 8 Internal nodes.
Mobile Robotics: 11. Kinematics 2
Inverse Kinematics Jacobian Matrix Trajectory Planning
Collision Detection David Johnson Cs6360 – Virtual Reality.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
FastDTW: Toward Accurate Dynamic Time Warping in Linear Time and Space
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.
Belief space planning assuming maximum likelihood observations Robert Platt Russ Tedrake, Leslie Kaelbling, Tomas Lozano-Perez Computer Science and Artificial.
Needle Steering Force Model and Trajectory Planning
MESA LAB Multi-view image stitching Guimei Zhang MESA LAB MESA (Mechatronics, Embedded Systems and Automation) LAB School of Engineering, University of.
Math / Physics 101 GAM 376 Robin Burke Fall 2006.
Forward-Scan Sonar Tomographic Reconstruction PHD Filter Multiple Target Tracking Bayesian Multiple Target Tracking in Forward Scan Sonar.
Modeling & Planning Deniz Güven Needle Insertion.
Applications of Dynamic Programming and Heuristics to the Traveling Salesman Problem ERIC SALMON & JOSEPH SEWELL.
Magnetism Alternating-Current Circuits
Avoiding Planetary Rover Damage by Automated Path Planning Michael Flammia Mentor: Dr. Wolfgang Fink Tempe, AZ April 18 th, 2015.
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,
A B C D E F A ABSTRACT A novel, efficient, robust, feature-based algorithm is presented for intramodality and multimodality medical image registration.
ROBOT VISION LABORATORY 김 형 석 Robot Applications-B
REFERENCES: FLOCKING.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Mission Development: Putting It All Together ASEN 6008 Interplanetary Mission Design.
MultiModality Registration Using Hilbert-Schmidt Estimators By: Srinivas Peddi Computer Integrated Surgery II April 6 th, 2001.
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
STAR SVT Self Alignment V. Perevoztchikov Brookhaven National Laboratory,USA.
Tracking Hands with Distance Transforms Dave Bargeron Noah Snavely.
CIVET seminar Presentation day: Presenter : Park, GilSoon.
Rigid Needles, Steerable Needles, and Optimal Beam Algorithms Ovidiu Daescu Bio-Medical Computing Laboratory Department of Computer Science University.
Optimal Acceleration and Braking Sequences for Vehicles in the Presence of Moving Obstacles Jeff Johnson, Kris Hauser School of Informatics and Computing.
CS b659: Intelligent Robotics
Distance Computation “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presentation by Julie Letchner.
EE631 Cooperating Autonomous Mobile Robots Lecture: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Fast and Robust Object Tracking with Adaptive Detection
CPSC 531: System Modeling and Simulation
Day 29 Bug Algorithms 12/7/2018.
Day 29 Bug Algorithms 12/8/2018.
Limits of Accuracy.
Using Parametric Curves to Describe Motions
Limits of Accuracy.
Presentation transcript:

Feedback Control for Steering Needles Through 3D Deformable Tissue Using Helical Paths Kris Hauser, Ron Alterovitz, Nuttapon Chentanez, Allison Okamura, Ken Goldberg. Yajia Zhang

Background Needles are used in medicine for a wide range of diagnostic and therapy delivery procedures. Needle tip must be positioned accurately at the target in the tissue. But the process requires skills. Errors may occur even under image guidance. Feedback controller that steers the needle and places the needle tip at the target even under the perturbation of the tissue and deflection of the needle trajectory.

Background Bevel-tip steerable needle Steering the needle: 1.Force along the z axis. Cause the needle tip rotate about the x axis. 2.Rotate about the z axis. Constant-Insertion-Speed and Constant-Twist-Rate Helix Trajectory of needle tip Needle tip position determined by inserted distance d and twist rate φ.

Goal Feedback controller to steer the bevel-tip needle with: 1.Constant insertion speed 2.Different twist rate to reach the target in the tissue.

Why real time planner Deformation of the tissue. Cause position of the target change. Deflection of the planned trajectory.

Controller Framework For every iteration: I.Propose: Generate a set P of proposal trajectories. Different φ maps to different trajectory. II.Select: Find the trajectory with control φ (d) in the set P that achieves the minimal distance to the target. III.Execute: Insert according to φ (d) and constant velocity for time Δt.

I. Propose Generate Proposal Trajectories When inserting the needle into the tissue, we build the coordinate frame according to the position of the needle tip.

Constant-Twist-Rate Helical Paths After moving along the helix trajectory, we need to know what the coordinate of the need tip according to the initial frame. : Helix with radius a, slope θ and oriented along the z axis.

Constant-Twist-Rate Helical Paths : coordinate of the needle tip followed under a constant twist rate φ and insertion d. Rigid Transformation:

Constant-Twist-Rate Reachable Set The trajectory with infinity twist rate will almost along the z axis.

Alternating-Twist Maneuver For finite maximum twist rate, alternating-twist maneuver can reduce the gap along the z axis.

Alternating-Twist Maneuver To fill in the gap, we consider the maneuver that makes a full turn of the helix with twist rate, and another with twist rate

II. Select Choose the trajectory with minimum distance to target Minimize + proposal trajectories in the gap Auxiliary function is used to calculate a tight lower bound of given a region R.

Branch-and-Bound A search tree recursively split the space into subregions. We maintain the helix * and insertion distance d* which give the minimum value of f. If of subregion R gives value larger than f, we can safely prune the region. We continue the process until f achieves an ε tolerance.

III. Execute Insert according to the select trajectory for time Δt or some distance Δd.

Simulation

Simulation Result Accuracy: The final distance from the needle tip to the target when the controller terminates. Reference controller: A refresh occurs every 2%r of insertion distance, maximum twist rate = 10π rad/r

Simulation Result Accuracy Without Perturbations:

Simulation Result Accuracy Under Perturbations and Modeling Errors: Gaussian Noise

Possible Improvement Avoid the obstacles Set intermediate Target’. When reaching Target’, we may just assume the Target moved. Target Target’

Issue About Real Time Planning How often should we re-plan? The reference controller refreshes after inserting length s= 2%r to achieve high accuracy. What if the deformation and deflection do not happen (or some tiny changes)? Complex system may require intense computation in re-planning.