Motion Planning: A Journey of Robots, Digital Actors, Molecules and Other Artifacts Jean-Claude Latombe Computer Science Department Stanford University.

Slides:



Advertisements
Similar presentations
Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
Advertisements

Motion Planning for Point Robots CS 659 Kris Hauser.
PRM and Multi-Space Planning Problems : How to handle many motion planning queries? Jean-Claude Latombe Computer Science Department Stanford University.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
Slide 1 Robot Lab: Robot Path Planning William Regli Department of Computer Science (and Departments of ECE and MEM) Drexel University.
Presented By: Aninoy Mahapatra
Probabilistic Roadmap
An Efficient Motion Planner Based on Random Sampling Jean-Claude Latombe Computer Science Department Stanford University.
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
NUS CS5247 Randomized Kinodynamic Motion Planning with Moving Obstacles - D. Hsu, R. Kindel, J.C. Latombe, and S. Rock. Int. J. Robotics Research, 21(3): ,
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:
1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Introduction abridged version.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
1 Last lecture  Path planning for a moving Visibility graph Cell decomposition Potential field  Geometric preliminaries Implementing geometric primitives.
Motion Planning: A Journey of Robots, Digital Actors, Surgical Instruments, Molecules and Other Artifacts Jean-Claude Latombe Computer Science Department.
CS 326A: Motion Planning Jean-Claude Latombe CA: Aditya Mandayam.
Robotics R&N: ch 25 based on material from Jean- Claude Latombe, Daphne Koller, Stuart Russell.
1 On the Probabilistic Foundations of Probabilistic Roadmaps D. Hsu, J.C. Latombe, H. Kurniawati. On the Probabilistic Foundations of Probabilistic Roadmap.
1 Finding “Narrow Passages” with Probabilistic Roadmaps: The Small-Step Retraction Method Mitul Saha and Jean-Claude Latombe Research supported by NSF,
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Jean-Claude Latombe Computer Science Department Stanford University.
Randomized Motion Planning
CS 326 A: Motion Planning Instructor: Jean-Claude Latombe Teaching Assistant: Itay Lotan Computer Science.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Basic Techniques.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Dongkyu, Choi.
CS 326 A: Motion Planning 2 Dynamic Constraints and Optimal Planning.
CS 99k: Digital Actors URL: Instructor: 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.
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,
Motion Algorithms: Planning, Simulating, Analyzing Motion of Physical Objects Jean-Claude Latombe Computer Science Department Stanford University.
CS 326A: Motion Planning Kynodynamic Planning + Dealing with Moving Obstacles + Dealing with Uncertainty + Dealing with Real-Time Issues.
CS 326A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Jean-Claude Latombe Computer Science Department Stanford University.
Path Planning in Expansive C-Spaces D. HsuJ.-C. LatombeR. Motwani CS Dept., Stanford University, 1997.
Spring 2007 Motion Planning in Virtual Environments Dan Halperin Yesha Sivan TA: Alon Shalita Basics of Motion Planning (D.H.)
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
CS6370/ME6225 Geometric Computation for Motion Planning Instructor: David Johnson
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
B659: Principles of Intelligent Robot Motion Kris Hauser TA: Mark Wilson.
Anna Yershova Dept. of Computer Science University of Illinois
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
Motion Planning Motion Planning. 1.What is the motion planning problem? 2.What is the fundamental question in motion planning problem? 3.What is the basic.
9/14/2015CS225B Kurt Konolige Locomotion of Wheeled Robots 3 wheels are sufficient and guarantee stability Differential drive (TurtleBot) Car drive (Ackerman.
© Manfred Huber Autonomous Robots Robot Path Planning.
Lecture 2: Introduction to Concepts in Robotics
Robotics Chapter 5 – Path and Trajectory Planning
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.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
Introduction to Motion Planning
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Real-time motion planning for Manipulator based on Configuration Space Chen Keming Cis Peking University.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
1 CS26N: Motion Planning for Robots, Digital Actors, and Other Moving Objects Jean-Claude Latombe ai.stanford.edu/~latombe/ Winter.
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
Motion Planning CS121 – Winter Basic Problem Are two given points connected by a path?
Instructor Prof. Shih-Chung Kang 2008 Spring
Artificial Intelligence Lab
Last lecture Configuration Space Free-Space and C-Space Obstacles
Probabilistic Roadmap Motion Planners
Presented By: Aninoy Mahapatra
Sampling and Connection Strategies for Probabilistic Roadmaps
Motion Planning CS121 – Winter 2003 Motion Planning.
Configuration Space of an Articulated Robot
Presentation transcript:

Motion Planning: A Journey of Robots, Digital Actors, Molecules and Other Artifacts Jean-Claude Latombe Computer Science Department Stanford University

My Research Interests u u Autonomous agents that sense, plan, and act in real and/or virtual worlds u u Algorithms and systems for representing, capturing, planning, controlling, and rendering motions of physical objects u u Applications: – –Manufacturing – –Mobile robots – –Computational biology – –Computer-assisted surgery – –Digital actors

Goal of Motion Planning u Compute motion strategies, e.g.: –geometric paths –time-parameterized trajectories –sequence of sensor-based motion commands u To achieve high-level goals, e.g.: –go to A without colliding with obstacles –assemble product P –build map of environment E –find object O

Goal of Motion Planning u Compute motion strategies, e.g.: –geometric paths –time-parameterized trajectories –sequence of sensor-based motion commands u To achieve high-level goals, e.g.: –go to A without colliding with obstacles –assemble product P –build map of environment E –find object O

Goal of Motion Planning u Compute motion strategies, e.g.: –geometric paths –time-parameterized trajectories –sequence of sensor-based motion commands u To achieve high-level goals, e.g.: –go to A without colliding with obstacles –assemble product P –build map of environment E –find object O

Examples

Is It Easy?

Basic Problem u Statement: Compute a collision-free path for a rigid or articulated object (the robot) among static obstacles u Inputs: –Geometry of robot and obstacles –Kinematics of robot (degrees of freedom) –Initial and goal robot configurations (placements) u Outputs: –Continuous sequence of collision-free robot configurations connecting the initial and goal configurations

Example with Rigid Object

Example with Articulated Object

Extensions to the Basic Problem u Moving obstacles u Multiple robots u Movable objects u Deformable objects u Goal is to gather data by sensing u Nonholonomic constraints u Dynamic constraints u Optimal planning u Uncertainty in control and sensing

Application: Design for Manufacturing General Electric General Motors

Application: Robot Programming and Placement David Hsu’s PhD

Application: Checking Building Code Charles Han’s PhD

Application: Generation of Instruction Sheets

Application: Model Construction by Mobile Robot Hector Gonzalez’s PhD

Application: Graphic Animation of Digital Actors James Kuffner’s PhD

Application: Computer-Assisted Surgical Planning Rhea Tombropoulos’s PhD Joel Brown’s PhD

Application: Prediction of Molecular Motions Amit Singh’s PhD

Motion in Configuration Space q 2 q 1 q 3 q 0 q n q 4 Q(t) Parts DOF L H

Disc Robot in 2-D Workspace

Rigid Robot Translating in 2-D CB = B A = {b - a | a in A, b in B}

Rigid Robot Translating and Rotating in 2-D

C-Obstacle for Articulated Robot

Other Representation Concepts u State space (configuration x velocity) u Configuration/state x time space u Composite configuration/state spaces u Stability regions in configuration/state spaces u Visibility regions in configuration/state spaces u Etc …

Motion Planning as a Computational Problem u Goal: Compute the connectivity of a space (e.g., the collision-free subset of configuration space) u High computational complexity: Typically requires time exponential in an input parameter, e.g., the number of degrees of freedom, the number of moving obstacles, … u Two main algorithmic approaches: –Planning by random sampling –Planning by computing criticalities

Motion Planning as a Computational Problem u Goal: Characterize the connectivity of a space (e.g., the collision-free subset of configuration space) u High computational complexity: Requires time exponential in number of degrees of freedom, or number of moving obstacles, or etc… u Two main algorithmic approaches: –Planning by random sampling –Planning by extracting criticalities

Motion Planning as a Computational Problem u Goal: Characterize the connectivity of a space (e.g., the collision-free subset of configuration space) u High computational complexity: Requires time exponential in number of degrees of freedom, or number of moving obstacles, or etc… u Two main algorithmic approaches: –Planning by random sampling –Planning by extracting criticalities

Principle of Randomized Planning free space qbqbqbqb qgqgqgqg milestone [Kavraki, Svetska, Latombe,Overmars, 95] (Probabilistic Roadmap)

Why Does it Work? [Kavraki, Latombe, Motwani, Raghavan, 95]

In Theory, a PRM Planner … u Is probabilistically complete, i.e., whenever a solution exists, the probability that it finds one tends toward 1 as the number N of milestones increases u Under rather general hypotheses, the rate of convergence is exponential in the number N of milestones, i.e.: Prob[failure] ~ exp(-N)

In practice, PRM Planners … u Are fast u Deal effectively with many-dof robots u Are easy to implement u Have solved complex problems

Example 1: Planning of Manipulation Motions Reach Grab Transfer Release Return

Example 2: Air-Cushioned Robot air bearing gaz tank air thrusters obstacles robot (Aerospace Robotics Lab)

Total duration : 40 sec

Example 3: Radiosurgical Planning Cyberknife (Neurosurgery Dept., Stanford, Accuray)

Surgeon Specifies Dose Constraints Critical Tumor Fall-off of Dose Around the Tumor Dose to the Tumor Region Dose to the Critical Region Fall-off of Dose in the Critical Region

Beam Selection Algorithm u Place points uniformly at random on the surface of the tumor u Pick beam orientations at random at these points

Beam Selection Algorithm u Place points uniformly at random on the surface of the tumor u Pick beam orientations at random at these points

Compute Beam Weights 2000 < Tumor < < B2 + B4 < < B4 < < B3 + B4 < < B3 < < B1 + B3 + B4 < < B1 + B4 < < B1 + B2 + B4 < < B1 < < B1 + B2 < < Critical < < B2 < 500 T C B1 B2 B3 B4 T

Sample Case Linac plan 80% Isodose surface CARABEAMER’s plan 80% Isodose surface

Sample Case 50% Isodose Surface 80% Isodose Surface Linac plan CARABEAMER’s plan

Example 4: Indoor Map Building by Robot

Next-Best View Strategy

Computing Next Sensing Position u Sample the free edges of the visited region at random. For each sample point, compute the subset of visited region from which this point is visible and sample this subset at random. >> Set of candidate positions q u Select “best” candidate q based on following criteria: –overlap of visible environment edges (to ensure reliable alignment) –amount of potential new space visible from q –length of path to go to q

Map Construction Example

Robotics Lab Map 45m

Example 5: Digital Actor with Vision Sensing

Example 6: Predicting Molecule Docking Motions

Future Work: Minimally Invasive Surgey Amidst Soft Tissue Structures

Future Work: Autonomous Interactive Characters A Bug’s Life (Pixar/Disney) Toy Story (Pixar/Disney) Tomb Raider 3 (Eidos Interactive)Final Fantasy VIII (SquareOne)The Legend of Zelda (Nintendo) Antz (Dreamworks)

Future Work: Protein Folding

Summary/Conclusion u Over the last decade there has been considerable progress in motion planning techniques and their application u While motion planning originated in robotics, the areas of application are now very diverse: product design, manufacturing, graphic animation, video games, biology, etc… u There are orders of magnitude more processors embedded in physical devices (cars, planes, surgical instruments, etc) than desktop computers, and the gap is still growing. The interest in modeling and computing the motion of physical objects will continue to grow.