Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Introduction abridged version.

Slides:



Advertisements
Similar presentations
1 Motion and Manipulation Configuration Space. Outline Motion Planning Configuration Space and Free Space Free Space Structure and Complexity.
Advertisements

Configuration Space. Recap Represent environments as graphs –Paths are connected vertices –Make assumption that robot is a point Need to be able to use.
Complete Motion Planning
Fall Path Planning from text. Fall Outline Point Robot Translational Robot Rotational Robot.
Motion Planning for Point Robots CS 659 Kris Hauser.
Slide 1 Robot Lab: Robot Path Planning William Regli Department of Computer Science (and Departments of ECE and MEM) Drexel University.
Kinematics & Grasping Need to know: Representing mechanism geometry Standard configurations Degrees of freedom Grippers and graspability conditions Goal.
Trajectory Generation
INTRODUCTION TO DYNAMICS ANALYSIS OF ROBOTS (Part 6)
Multi-Robot Motion Planning Jur van den Berg. Outline Recap: Configuration Space for Single Robot Multiple Robots: Problem Definition Multiple Robots:
Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.
Paper by Kevin M.Lynch, Naoji Shiroma, Hirohiko Arai, and Kazuo Tanie
Introduction to Robotics
Trajectory Week 8. Learning Outcomes By the end of week 8 session, students will trajectory of industrial robots.
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.
Time to Derive Kinematics Model of the Robotic Arm
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Algorithmic motion planning, an overview.
“Inverse Kinematics” The Loop Closure Problem in Biology Barak Raveh Dan Halperin Course in Structural Bioinformatics Spring 2006.
Robotics R&N: ch 25 based on material from Jean- Claude Latombe, Daphne Koller, Stuart Russell.
CS 326A: Motion Planning Configuration Space. Motion Planning Framework Continuous representation (configuration space and related spaces + constraints)
Planning Among Movable Obstacles with Artificial Constraints Presented by: Deborah Meduna and Michael Vitus by: Mike Stilman and James Kuffner.
Almost Tight Bound for a Single Cell in an Arrangement of Convex Polyhedra in R 3 Esther Ezra Tel-Aviv University.
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Assembly planning.
BINARY MORPHOLOGY and APPLICATIONS IN ROBOTICS. Applications of Minkowski Sum 1.Minkowski addition plays a central role in mathematical morphology 2.It.
Introduction to Robotics (ES159) Advanced Introduction to Robotics (ES259) Spring Ahmed Fathi
NUS CS 5247 David Hsu Minkowski Sum Gokul Varadhan.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 O’Rourke Chapter 8 Motion Planning.
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 On the Existence of Form- Closure Configurations on a Grid A.Frank van der Stappen Presented by K. Gopalakrishnan.
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 Coordination of Multiple Robots.
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.
Robot Motion Planning Computational Geometry Lecture by Stephen A. Ehmann.
Definition of an Industrial Robot
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
4/21/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Motion Planning Carola Wenk.
Class material vs. Lab material – Lab 2, 3 vs. 4,5, 6 BeagleBoard / TI / Digilent GoPro.
May Motion Planning Shmuel Wimer Bar Ilan Univ., Eng. Faculty Technion, EE Faculty.
© Manfred Huber Autonomous Robots Robot Path Planning.
Lecture 2: Introduction to Concepts in Robotics
Chapter 2 Robot Kinematics: Position Analysis
Computational Geometry Piyush Kumar (Lecture 10: Robot Motion Planning) Welcome to CIS5930.
Introduction to Robot Motion Planning Robotics meet Computer Science.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
October 9, 2003Lecture 11: Motion Planning Motion Planning Piotr Indyk.
Robot Kinematics: Position Analysis 2.1 INTRODUCTION  Forward Kinematics: to determine where the robot ’ s hand is? (If all joint variables are known)
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.
Configuration Spaces for Translating Robots Minkowsi Sum/Difference David Johnson.
ROBOT VISION LABORATORY 김 형 석 Robot Applications-B
Outline: Introduction Solvability Manipulator subspace when n<6
Robotics Chapter 5 – Path and Trajectory Planning
Rick Parent - CIS681 Reaching and Grasping Reaching control synthetic human arm to reach for object or position in space while possibly avoiding obstacles.
4/9/13CMPS 3120 Computational Geometry1 CMPS 3120: Computational Geometry Spring 2013 Motion Planning Carola Wenk.
NUS CS 5247 David Hsu Configuration Space. 2 What is a path?
Real-Time Configuration Space Transforms for Obstacle Avoidance Wyatt S. Newman and Michael S. Branicky.
Robotics Chapter 3 – Forward Kinematics
2.1 Introduction to Configuration Space
Computer Output Device: Arm Robot
CHAPTER 2 FORWARD KINEMATIC 1.
Special English for Industrial Robot
C-obstacle Query Computation for Motion Planning
Presented By: Aninoy Mahapatra
Intelligent Robotics - part 1 F2RO/F21RO
Motion and Manipulation
Outline: Introduction Solvability Manipulator subspace when n<6
Special English for Industrial Robot
Chapter 4 . Trajectory planning and Inverse kinematics
Presentation transcript:

Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Introduction abridged version

Robots, take I

An extremely brief history of robotics The RUR robot which appeared in an adaption of Czech author Karel Capek's Rossum's Universal Robots. Circa 1930's. For more, see, e.g., pages.cpsc.ucalgary.ca/~jaeger/visual Media/robotHistory.html UNIMATE becomes the first industrial robot in use. It was used at the General Motors factory in New Jersey. NASA's PathFinder lands on Mars,1997 Honda ’ s ASIMO 2002

Motion planning: the basic problem Let B be a system (the robot) with k degrees of freedom moving in a known environment cluttered with obstacles. Given free start and goal placements for B decide whether there is a collision free motion for B from start to goal and if so plan such a motion.

A disc moving among discs ?

Terminology  Workspace  Configuration  Degree of freedom (dof)

Configuration space of a robot system with k degrees of freedom  the space of parametric representation of all possible robot configurations  C-obstacles: the expanded obstacles  the robot -> a point  k dimensional space  point in configuration space: free, forbidden, semi-free  path -> curve

C-obstacles Q - a polygonal object that moves by translation P - a set of polygonal obstacles reference point

Minkow s ki sums and translational C-obstacles  A  B= {a+b | a  A, b  B}  Let -A denote A with the ref point at the origin and rotated by 180 deg around the origin  The robot A(q) intersects the obstacle B iff q  B  -A  Minkowski sums of convex polygons: complexity and construction

More complex systems  Already in the plane, if we allow rotation as well, the problem has 3 dofs  Bodies translating and rotating in 3-space  Industrial manipulators (typically have 4,5, or 6 dofs)  New designs, multi-robot systems, and other moving artifacts have many more dofs

Types of solutions  Exact  Heuristic  Hybrid  A major component in practical solutions: collision detection

Cluterred environments

Oskar

Algorithmic robotics, automation assembly planning  Movable separability  Assembly planning with two hands  Motion space [Snoeyink-Stolfi 93]

Robots, take II

Beyond the basic mop problem  Moving obstacles  Multiple robots  Movable objects  Uncertainty  Nonholonomic constraints  Dynamic constraints  …

Optimality, path quality  Length  Clearance  Group motion: tradeoff Kamphuis-Overmas,

Kinematics  Link  Joint  Base  Tcp  Kinematic chain  Direct kinematics  Inverse kinematics

Robots with many dofs

Sensorless manipulaion Example: the parallel jaw gripper [Goldberg]

Course outline see

THE END