Planning Curvature and Torsion Constrained Ribbons for Intracavitary Brachytherapy Sachin Patil, Jia Pan, Pieter Abbeel, Ken Goldberg UC Berkeley EECS.

Slides:



Advertisements
Similar presentations
NUS CS5247 Motion Planning for Car- like Robots using a Probabilistic Learning Approach --P. Svestka, M.H. Overmars. Int. J. Robotics Research, 16: ,
Advertisements

Motion Planning for Point Robots CS 659 Kris Hauser.
FIRST (FP7/Marie-Curie) Fronts and Interfaces in Science & Technlogy Adaptive and directional local processing in image processing Arpan Ghosh Supervisor:
PRM and Multi-Space Planning Problems : How to handle many motion planning queries? Jean-Claude Latombe Computer Science Department Stanford University.
Sampling Strategies for PRMs modified from slides of T.V.N. Sri Ram.
Nonlinear Optimization for Optimal Control
4/15/2017 Using Gaussian Process Regression for Efficient Motion Planning in Environments with Deformable Objects Barbara Frank, Cyrill Stachniss, Nichola.
LECTURE SERIES on STRUCTURAL OPTIMIZATION Thanh X. Nguyen Structural Mechanics Division National University of Civil Engineering
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.
Geometric Algorithms for Conformational Analysis of Long Protein Loops J. Cortess, T. Simeon, M. Remaud- Simeon, V. Tran.
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song and Nancy M. Amato Department of Computer Science Texas A&M University College Station,
Presenter: Robin van Olst. Avneesh SudRussell Gayle Erik Andersen Stephen GuyMing Lin Dinesh Manocha.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
Multi-Robot Motion Planning #2 Jur van den Berg. Outline Recap: Composite Configuration Space Prioritized Planning Planning in Dynamic Environments Application:
“Inverse Kinematics” The Loop Closure Problem in Biology Barak Raveh Dan Halperin Course in Structural Bioinformatics Spring 2006.
1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, U.C. Berkeley.
Curves Locus of a point moving with one degree of freedom
Motion Planning for Legged Robots on Varied Terrain Kris Hauser, Timothy Bretl, Jean-Claude Latombe Kensuke Harada, Brian Wilcox Presented By Derek Chan.
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 20: Inverse Kinematics Ravi Ramamoorthi Most slides courtesy.
Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Presented by Mohammed Irfan Rafiq.
Planning for Humanoid Robots Presented by Irena Pashchenko CS326a, Winter 2004.
Presented By: Huy Nguyen Kevin Hufford
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song, Nancy M. Amato Department of Computer Science Texas A&M University College Station,
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
CS 326 A: Motion Planning Kinodynamic Planning.
Introduction to Brachytherapy
Feedback Control for Steering Needles Through 3D Deformable Tissue Using Helical Paths Kris Hauser, Ron Alterovitz, Nuttapon Chentanez, Allison Okamura,
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
Introduction Tracking the corners Camera model and collision detection Keyframes Path Correction Controlling the entire path of a virtual camera In computer.
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.
© Manfred Huber Autonomous Robots Robot Path Planning.
Robotics Chapter 5 – Path and Trajectory Planning
Beyond trial and error…. Establish mathematically how robot should move Kinematics: how robot will move given motor inputs Inverse-kinematics: how to.
Real Time Motion Planning. Introduction  What is Real time Motion Planning?  What is the need for real time motion Planning?  Example scenarios in.
Ioannis Karamouzas, Roland Geraerts and A. Frank van der Stappen Space-time Group Motion Planning.
Path Planning for a Point Robot
Medical Imaging Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Medical Image Analysis Image Registration Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Modeling & Planning Deniz Güven Needle Insertion.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Introduction to Motion Planning
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
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Rapidly-exploring.
A Grasp-Based Motion Planning Algorithm for Character Animation M. Kalisiak, M. van de Panne Eurographics Workshop on Computer Animation & Simulation 2000.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Optimization-Based Cooperative Multi-Robot Target Tracking with Reasoning about Occlusions Karol Hausman, Gregory Kahn, Sachin Patil, Joerg Mueller, Ken.
Department of Computer Science Columbia University rax Dynamically-Stable Motion Planning for Humanoid Robots Paper Presentation James J. Kuffner,
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.
Instructor Prof. Shih-Chung Kang 2008 Spring
Serret-Frenet Equations
Globally Optimal Generalized Maximum Multi Clique Problem (GMMCP) using Python code for Pedestrian Object Tracking By Beni Mulyana.
Homework Aid: Cycloid Motion
Dimitris Valeris Thijs Ratsma
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Stefan Oßwald, Philipp Karkowski, Maren Bennewitz
Computer Animation Algorithms and Techniques
Presentation transcript:

Planning Curvature and Torsion Constrained Ribbons for Intracavitary Brachytherapy Sachin Patil, Jia Pan, Pieter Abbeel, Ken Goldberg UC Berkeley EECS

Cancer Sites

Brachytherapy Internal radiation therapy – Radioactive source travels in catheters to tumor vicinity Intracavitary Brachytherapy

Limitations of current treatment options: Lack of proximity to tumor  Insufficient radiation to tumor volume Undesirable radiation exposure to healthy tissue Patient discomfort, no personalization

Tumor Coverage Standard approachNew approach Multiple dose locations desired proximal to tumor

3D Printing Stratasys uPrint SE Plus 3D Systems ProJET HD D Printed Implant [Garg et al. 2013]

Customized 3D Printed Implants [Garg et al. 2013]

Channel Constraints Curvature constraints: Finite dimensions of radioactive seed Limited flexibility of catheters Extraction of support material

Independent Channels Infeasible for larger number of dose locations Mutually collision free Constraints on local/cumulative curvature

Ribbons

Improved arrangement  Improved coverage How do we create these implants?

Ribbon Kinematic Model Consider ribbon cross-section: Orient ribbon cross-section along binormal of Frenet-Serret frame [Frenet 1847; Serret 1851]

Ribbon Kinematic Model Frenet-Serret equations: Some manipulation yields:

Ribbon Kinematic Model This gives the following model:Planning parameters: : speed : curvature : torsion

Why Frenet-Serret Frame? Different curvatures, lengths: Difficult to plan for Same curvatures, lengths: Easier to plan for

Problem Specification Input: Implant volume conforming to patient anatomy from CT/MR scans Dose dwell segment poses Parameters of catheter and radioactive source  channel width, curvature and torsion limits

Problem Specification Objective: Compute ribbons such that: Curvature and torsion constrained Optimal – minimize energy Mutually collision-free

Related Work Planning rigid body motions in SE(3) without obstacles: Zefran et al. 1998; Belta et al. 2004; Goemans et al. 2005; Biggs et al. 2008; Cripps et al. 2012; etc. Planning using physically-based models of curves/ribbons: Moll et al. 2006; Bretl et al. 2014; etc. Planning for bevel-tip steerable needles: Alterovitz et al. 2006,2007; Hauser et al. 2009; Xu et al. 2009; Duindam et al. 2010; Van den Berg et al. 2010; Patil et al. 2012; etc.

Planning Challenges Nonholonomic systemCollision avoidance

Planning Approach Two steps: Sequential: Rapidly-exploring random trees (RRT) in SE(3) state space Simultaneous: Local optimization using sequential quadratic programming (SQP)

RRT Planner a b Sample random point in R 3 Find nearest tree node that contains sample within reachable set Connect Add new node and edge to tree Repeat till goal found or maximum iterations exceeded Collision detection a entry dose dwell segment For each dose dwell segment: [Patil et al. 2012; Garg et al. 2013]

RRT Limitations Non-smooth ribbons; unnecessary twists No notion of optimality

(Simultaneous) Local Optimization Optimization variables: Minimize energy (rotational strain) : subject to Entry / initial pose constraint Kinematic constraints Bounds on curvature/torsion Collision constraints [Schulman et al. 2013]

Optimization on SE(3) SE(3) is not a vector space: Locally parameterize SE(3) through its tangent space se(3)

Optimization on SE(3) 1)Seed trajectory: 2) Solve: where and 3)Compute new trajectory: [Saccon et al. 2013]

RRT + Local Optimization Two steps: Sequential: Rapidly-exploring random trees (RRT) in SE(3) state space Simultaneous: Local optimization using sequential quadratic programming (SQP)

RRT + Local Optimization

Intracavitary Brachytherapy Scenario RRT: Collision-free ribbons; unnecessary twists RRT + Local optimization: final solution

Intracavitary Brachytherapy Scenario 46% improvement in coverage (metric as defined by Garg et al. 2013) Limited to 18 channelsCan include up to 36 channels

Performance [single 3.5 Ghz Intel i7 processor]

Address global optimality of solutions [Bento et al. NIPS 2013s] Automatic computation of dose dwell segments Clinical studies (UC San Francisco Medical Center) Future Work

Ribbons – Planning Applications

Source available at: Thank You Contact:

Narrow Passage Scenario No probabilistic completeness guarantees

Thank you

ABC ABC: XYZ