570 likes | 579 Views
CS 326 A: Motion Planning. http://robotics.stanford.edu/~latombe/cs326/2002 Instructor: Jean-Claude Latombe Teaching Assistant: Itay Lotan Computer Science Department Stanford University. Goal of Motion Planning. Compute motion strategies , e.g.: geometric paths
E N D
CS 326 A: Motion Planning http://robotics.stanford.edu/~latombe/cs326/2002 Instructor: Jean-Claude Latombe Teaching Assistant: Itay Lotan Computer Science Department Stanford University
Goal of Motion Planning • Compute motion strategies, e.g.: • geometric paths • time-parameterized trajectories • sequence of sensor-based motion commands • 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
Fundamental Question Are two given points connected by a path?
Basic Problem • Statement:Compute a collision-free path for a rigid or articulated object (the robot) among static obstacles • Inputs: • Geometry of robot and obstacles • Kinematics of robot (degrees of freedom) • Initial and goal robot configurations (placements) • Output: • Continuous sequence of collision-free robot configurations connecting the initial and goal configurations
Piano-mover problem Examples with Rigid Object Ladder problem
Tool: Configuration Space • Problems: • Geometric complexity • Space dimensionality
Moving obstacles Multiple robots Movable objects Assembly planning Goal is to acquire information by sensing Model building Object finding/tracking Nonholonomic constraints Dynamic constraints Optimal planning Uncertainty in control and sensing Exploiting task mechanics (sensorless motions) Physical models and deformable objects Integration of planning and control Some Extensions of Basic Problem
Aerospace Robotics Lab Robot robot obstacles air thrusters gas tank air bearing
Two concurrent planning goals: • Reach the goal • Reach a safe region Total duration : 40 sec
Autonomous Helicopter [Feron, 2000] (AA Dept., MIT)
Moving obstacles Multiple robots Movable objects Assembly planning Goal is to acquire information by sensing Model building Object finding/tracking Nonholonomic constraints Dynamic constraints Optimal planning Uncertainty in control and sensing Exploiting task mechanics (sensorless motions) Physical models and deformable objects Integration of planning and control Some Extensions of Basic Problem
Moving obstacles Multiple robots Movable objects Assembly planning Goal is to acquire information by sensing Model building Object finding/tracking Nonholonomic constraints Dynamic constraints Optimal planning Uncertainty in control and sensing Exploiting task mechanics (sensorless motions) Physical models and deformable objects Integration of planning and control Some Extensions of Basic Problem
Moving obstacles Multiple robots Movable objects Assembly planning Goal is to acquire information by sensing Model building Object finding/tracking Nonholonomic constraints Dynamic constraints Optimal planning Uncertainty in control and sensing Exploiting task mechanics (sensorless motions) Physical models and deformable objects Integration of planning and control Some Extensions of Basic Problem
Map Building Where to move next?
Moving obstacles Multiple robots Movable objects Assembly planning Goal is to acquire information by sensing Model building Object finding/tracking Nonholonomic constraints Dynamic constraints Optimal planning Uncertainty in control and sensing Exploiting task mechanics (sensorless motions) Physical models and deformable objects Integration of planning and control Some Extensions of Basic Problem
Moving obstacles Multiple robots Movable objects Assembly planning Goal is to acquire information by sensing Model building Object finding/tracking Nonholonomic constraints Dynamic constraints Optimal planning Uncertainty in control and sensing Exploiting task mechanics (sensorless motions) Physical models and deformable objects Integration of planning and control Some Extensions of Basic Problem
Moving obstacles Multiple robots Movable objects Assembly planning Goal is to acquire information by sensing Model building Object finding/tracking Nonholonomic constraints Dynamic constraints Optimal planning Uncertainty in control and sensing Exploiting task mechanics (sensorless motions) Physical models and deformable objects Integration of planning and control Some Extensions of Basic Problem
Motion Planning for Deformable Objects [Kavraki, 1999]
Manufacturing: Robot programming Robot placement Design of part feeders Design for manufacturing and servicing Design of pipe layouts and cable harnesses Autonomous mobile robots planetary exploration, surveillance, military scouting Graphic animation of “digital actors” for video games, movies, and webpages Medical surgery planning Generation of plausible molecule motions, e.g., docking and folding motions Building code verification Examples of Applications
Humanoid Robot [Kuffner and Inoue, 2000] (U. Tokyo)
Modular Reconfigurable Robots Casal and Yim, 1999 Xerox, Parc
Manufacturing: Robot programming Robot placement Design of part feeders Design for manufacturing and servicing Design of pipe layouts and cable harnesses Autonomous mobile robots planetary exploration, surveillance, military scouting Graphic animation of “digital actors” for video games, movies, and webpages Medical surgery planning Generation of plausible molecule motions, e.g., docking and folding motions Building code verification Examples of Applications
Design for Manufacturing/Servicing General Motors General Motors General Electric
Manufacturing: Robot programming Robot placement Design of part feeders Design for manufacturing and servicing Design of pipe layouts and cable harnesses Autonomous mobile robots planetary exploration, surveillance, military scouting Graphic animation of “digital actors” for video games, movies, and webpages Medical surgery planning Generation of plausible molecule motions, e.g., docking and folding motions Building code verification Examples of Applications
Manufacturing: Robot programming Robot placement Design of part feeders Design for manufacturing and servicing Design of pipe layouts and cable harnesses Autonomous mobile robots planetary exploration, surveillance, military scouting Graphic animation of “digital actors” for video games, movies, and webpages Medical surgery planning Generation of plausible molecule motions, e.g., docking and folding motions Building code verification Examples of Applications
Digital Actors Toy Story (Pixar/Disney) Antz (Dreamworks) A Bug’s Life (Pixar/Disney) Tomb Raider 3 (Eidos Interactive) The Legend of Zelda (Nintendo) Final Fantasy VIII (SquareOne)
Motion Planning for Digital Actors Manipulation Sensory-based locomotion
Manufacturing: Robot programming Robot placement Design of part feeders Design for manufacturing and servicing Design of pipe layouts and cable harnesses Autonomous mobile robots planetary exploration, surveillance, military scouting Graphic animation of “digital actors” for video games, movies, and webpages Medical surgery planning Generation of plausible molecule motions, e.g., docking and folding motions Building code verification Examples of Applications
Radiosurgical Planning Cross-firing at a tumor while sparing healthy critical tissue
Manufacturing: Robot programming Robot placement Design of part feeders Design for manufacturing and servicing Design of pipe layouts and cable harnesses Autonomous mobile robots planetary exploration, surveillance, military scouting Graphic animation of “digital actors” for video games, movies, and webpages Medical surgery planning Generation of plausible molecule motions, e.g., docking and folding motions Building code verification Examples of Applications
Protein folding • Ligand binding Study of the Motion of Bio-Molecules
Study of the Motion of Bio-Molecules • Protein folding • Ligand binding
Manufacturing: Robot programming Robot placement Design of part feeders Design for manufacturing and servicing Design of pipe layouts and cable harnesses Autonomous mobile robots planetary exploration, surveillance, military scouting Graphic animation of “digital actors” for video games, movies, and webpages Medical surgery planning Generation of plausible molecule motions, e.g., docking and folding motions Building code verification Examples of Applications
Goals of CS326A • Present a coherent framework for motion planning problems: • configuration space and related spaces • random sampling and criticality-based decomposition algorithms • Emphasis of “practical” algorithms with some guarantees of performance over “theoretical” or purely “heuristic” algorithms
Framework Continuous representation (configuration space formulation) Discretization (random sampling, criticality-based decomposition) Graph searching (blind, best-first, A*)
Goals of CS326A • Present a coherent framework for motion planning problems: • configuration space and related spaces • random sampling and criticality-based decomposition algorithms • Emphasis of “practical” algorithms with some guarantees of performance over “theoretical” or purely “heuristic” algorithms