CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Criticality-Based Motion Planning.

Slides:



Advertisements
Similar presentations
Motion Planning for Point Robots CS 659 Kris Hauser.
Advertisements

Manipulation Planning. In 1995 Alami, Laumond and T. Simeon proposed to solve the problem by building and searching a ‘manipulation graph’.
Motion planning, control and obstacle avoidance D. Calisi.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Criticality-Based Motion Planning (2)
Problem Solving What is AI way of solving problem?
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
CS 326 A: Motion Planning Coordination of Multiple Robots.
CS 326 A: Motion Planning Criticality-Based Planning.
CS 326 A: Motion Planning Assembly Planning.
CS 326 A: Motion Planning Humanoid and Legged Robots.
Multi-Arm Manipulation Planning (1994) Yoshihito Koga Jean-Claude Latombe.
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 ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Sampling Strategies.
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Algorithmic motion planning, an overview.
CS 326A: Motion Planning Jean-Claude Latombe CA: Aditya Mandayam.
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.
CS 326 A: Motion Planning Assembly Planning.
CS 326 A: Motion Planning Radiosurgical Planning.
CS 326A: Motion Planning Criticality-Based Motion Planning: Target Finding.
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.
A Geometric Approach to Error Detection and Recovery for Robot Motion Planning with Uncertainty Bruce R. Donald, 1988 Presented by Kristof Richmond.
CS 326 A: Motion Planning Manipulation Planning.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
CS 326A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Jean-Claude Latombe Computer Science Department Stanford University.
Motion Planning in Stereotaxic Radiosurgery A. Schweikard, J.R. Adler, and J.C. Latombe Presented by Vijay Pradeep.
NUS CS 5247 David Hsu Minkowski Sum Gokul Varadhan.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
Introduction to Robot Motion Planning. Example A robot arm is to build an assembly from a set of parts. Tasks for the robot: Grasping: position gripper.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
Generalized Standard Foot Trajectory for a Quadruped Walking Vehicle (Shigeo Hirose, Osamu Kunieda ) Presentation: Guillaume Poncin.
4/21/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Motion Planning Carola Wenk.
May Motion Planning Shmuel Wimer Bar Ilan Univ., Eng. Faculty Technion, EE Faculty.
Robotics Introduction Robot Hardware Robotic Perception Planning to Move Dynamics and Control Robotic Software Applications.
Computational Geometry Piyush Kumar (Lecture 10: Robot Motion Planning) Welcome to CIS5930.
Path Planning for a Point Robot
Introduction to Robot Motion Planning Robotics meet Computer Science.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
1 I. STRUCTURE OF SUBSTANCES I.2. Electronic configuration of the atoms Louis de Broglie (France) and Werner Schrödinger (Austria) in the mid 1920s, suggested.
Lecture 3: 18/4/1435 Searching for solutions. Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Physical Memory and Physical Addressing By Alex Ames.
Navigation & Motion Planning Cell Decomposition Skeletonization Bounded Error Planning (Fine-motion Planning) Landmark-based Planning Online Algorithms.
NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 3 –Problem Solving Agents State space search –Programming Assignment Thursday.
Name the type of tissue.. Name type of tissue.
1 Solving problems by searching Chapter 3. 2 Outline Problem types Example problems Assumptions in Basic Search State Implementation Tree search Example.
4/9/13CMPS 3120 Computational Geometry1 CMPS 3120: Computational Geometry Spring 2013 Motion Planning Carola Wenk.
Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.
Learning Sequential Composition Plans Using Reduced Dimensionality Examples Nik A. Melchior AAAI 2009 Spring Symposium Agents that Learn from Human Teachers.
I. STRUCTURE OF SUBSTANCES
Cover Option2.
Models of the Atom Foothill Chemistry.
LSI, SVD and Data Management
CHAPTER OBJECTIVES The primary objective of this chapter is to show how to compute the matrix inverse and to illustrate how it can be.
تحليل الحساسية Sensitive Analysis.
C-obstacle Query Computation for Motion Planning
التسعير الفصل الرابع عشر.
Motion Planning in Stereotaxic Radiosurgery
Criticality-Based Motion Planning (2)
Motion Planning CS121 – Winter 2003 Motion Planning.
PHY 711 Classical Mechanics and Mathematical Methods
Robotics meet Computer Science
Types of Errors And Error Analysis.
Classic Motion Planning Methods
Presentation transcript:

CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Criticality-Based Motion Planning

Trapezoidal decomposition

Criticality-Based Planning  Define a property P  Decompose the configuration space into “regular” regions (cells) over which P is constant.  Use this decomposition for planning  Issues: - What is P? It depends on the problem - How to use the decomposition?  Approach is practical only in low-dimensional spaces: - Complexity of the arrangement of cells - Sensitivity to floating point errors

Topics of this class and the next one  Target finding  Information (or belief) state/space  Part orientation  Sensorless reduction of uncertainty  Assembly planning  Path space  Stereotaxic radiosurgery