T RAJECTORY P LANNING University of Bridgeport 1 Introduction to ROBOTICS.

Slides:



Advertisements
Similar presentations
7.1 An Introduction to Polynomials
Advertisements

Notes 6.6 Fundamental Theorem of Algebra
Range, Height and Time.
University of Bridgeport
I NTRODUCTION TO R OBOTICS CPSC Lecture 5B – Control.
Manipulator Dynamics Amirkabir University of Technology Computer Engineering & Information Technology Department.
Circular Motion Example Problem 3: a t = f(t) A bead moves along a circular wire. Its speed increases at a = 2t – 4 m/s 2. Its initial (at t = 0) position.
Constant Jerk Trajectory Generator (TG)
Trajectory Generation
Path planning, 2012/2013 winter1 Robot Path Planning CONTENTS 1. Introduction 2. Interpolation.
INTRODUCTION TO DYNAMICS ANALYSIS OF ROBOTS (Part 6)
Trajectory Planning.  Goal: to generate the reference inputs to the motion control system which ensures that the manipulator executes the planned trajectory.
ME 4135 Fall 2011 R. R. Lindeke, Ph. D. Robot Dynamics – The Action of a Manipulator When Forced.
Finding Zeros Given the Graph of a Polynomial Function Chapter 5.6.
Paper by Kevin M.Lynch, Naoji Shiroma, Hirohiko Arai, and Kazuo Tanie
Trajectory Week 8. Learning Outcomes By the end of week 8 session, students will trajectory of industrial robots.
Trajectory Generation How do I get there? This way!
Inverse Kinematics Jacobian Matrix Trajectory Planning
Introduction to ROBOTICS
Velocity Analysis Jacobian
V ELOCITY A NALYSIS J ACOBIAN University of Bridgeport 1 Introduction to ROBOTICS.
INTRODUCTION TO DYNAMICS ANALYSIS OF ROBOTS (Part 5)
Trajectory Generation Cherevatsky Boris. Trajectory for single joint Suppose we are given a simple robot We want to move the joint from to in 4 seconds.
Definition of an Industrial Robot
Graphical Analysis of Motion.  First, it must be remembered that there are 3 different descriptions for motion  Constant position (at rest)  Constant.
AN-NAJAH NATIONAL UNIVERSITY DEPARTMENT OF MECHANICAL ENGINEERING
Robot Dynamics – Slide Set 10 ME 4135 R. R. Lindeke, Ph. D.
Chapter 5 Trajectory Planning 5.1 INTRODUCTION In this chapters …….  Path and trajectory planning means the way that a robot is moved from one location.
Chapter 5 Trajectory Planning 5.1 INTRODUCTION In this chapters …….  Path and trajectory planning means the way that a robot is moved from one location.
Robotics Chapter 5 – Path and Trajectory Planning
MAE505: Robotics Final Project – Papers Review. Presented By: Tao Gan Advisor: Dr. Venkat Krovi. Main Topic: Nonholonomic-Wheel Mobile Robot (WMR). Sub-Topics:
6.3 – Evaluating Polynomials. degree (of a monomial) 5x 2 y 3 degree =
INTRODUCTION TO DYNAMICS ANALYSIS OF ROBOTS (Part 3)
Class Work Find the real zeros by factoring. P(x) = x4 – 2x3 – 8x + 16
June D Object Representation Shmuel Wimer Bar Ilan Univ., School of Engineering.
The City College of New York 1 Dr. Jizhong Xiao Department of Electrical Engineering City College of New York Inverse Kinematics Jacobian.
Chapter 7: Trajectory Generation Faculty of Engineering - Mechanical Engineering Department ROBOTICS Outline: 1.
Chapter 6-3 Dividing Polynomials (std Alg 2 3.0) Objectives: To understand long division of polynomials To understand synthetic division of polynomials.
Outline: Introduction Solvability Manipulator subspace when n<6
7.1 Polynomial Functions Evaluate Polynomials
Trajectory Generation
Trajectory Generation Cherevatsky Boris. Mathematical Fact Given n+1 values of a n-degree polynomial : i.e. if we have the values: we can compute the.
Solving Equations Binomials Simplifying Polynomials
City College of New York 1 John (Jizhong) Xiao Department of Electrical Engineering City College of New York Mobile Robot Control G3300:
Robotics II Copyright Martin P. Aalund, Ph.D.
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
Introduction to Polynomials 24 February What is a polynomial? polynomial.
Algebra 2cc Section 2.10 Identify and evaluate polynomials A polynomial function is an expression in the form: f(x) = ax n + bx n-1 + cx n-2 + … dx + e.
Trajectory Generation
A polynomial is an expression that can be written in the form
Trajectory Generation
Notes Over 3.4 The Rational Zero Test
Yueshi Shen Dept. of Information Engineering
MAE505: Robotics Final Project – Papers Review.
From: Task-Based Optimal Design of Metamorphic Service Manipulators
Zaid H. Rashid Supervisor Dr. Hassan M. Alwan
University of Bridgeport
Special English for Industrial Robot
Spline Interpolation Method
Find all solutions of the polynomial equation by factoring and using the quadratic formula. x = 0 {image}
Warm-up: Find the equation of a quadratic function in standard form that has a root of 2 + 3i and passes through the point (2, -27). Answer: f(x) = -3x2.
Inverse Kinematics 12/30/2018.
SYSTEM OF ORDINARY DIFFERENTIAL EQUATIONS
Jeopardy Q $100 Q $100 Q $100 Q $100 Q $100 Q $200 Q $200 Q $200
Motion Control.
Outline: Introduction Solvability Manipulator subspace when n<6
Special English for Industrial Robot
Chapter 4 . Trajectory planning and Inverse kinematics
SYSTEM OF ORDINARY DIFFERENTIAL EQUATIONS
Constant Jerk Trajectory Generator (TG)
Presentation transcript:

T RAJECTORY P LANNING University of Bridgeport 1 Introduction to ROBOTICS

T RAJECTORY PLANNING In previous chapters, we learned how to plan paths for robot tasks. In order to execute these plans, a few more details must be specified. For example, what should be the joint velocities and accelerations while traversing the path? These questions are addressed by a trajectory planner. The trajectory planner computes a function q(t) that completely specifies the motion of the robot as it traverses the path.

T RAJECTORY PLANNING A trajectory is a function of time q(t) s.t. q(t 0 )=q s And q(t f )=q f. t f -t 0 : time taken to execute the trajectory. Point to point motion: plan a trajectory from the initial configuration q(t 0 ) to the final q(t f ). In some cases, there may be constraints (for example: if the robot must begin and end with zero velocity)

P OINT TO POINT MOTION Choose the trajectory of polynomial of degree n, if you have n+1 constraints. Ex (1):Given the 4 constraints: (n=3)

P OINT TO POINT MOTION Cubic Trajectories 4 coefficients (4 constraints) Define the trajectory q(t) to be a polynomial of degree 3 The desired velocity:

P OINT TO POINT MOTION Evaluation of the a i coeff to satify the constaints

P OINT TO POINT MOTION Combined the four equations into a single matrix equation.

P OINT TO POINT MOTION Example

P OINT TO POINT MOTION Cubic polynomial trajectory Matlab code: syms t; q=10-90*t^2+60*t^3; t=[0:0.01:1]; plot(t,subs(q,t)) xlabel('Time sec') ylabel('Angle(deg)')

P OINT TO POINT MOTION Velocity profile for cubic polynomial trajectory Matlab code: syms t; qdot=-180*t+180*t^2; t=[0:0.01:1]; plot(t,subs(qdot,t)) xlabel('Time sec') ylabel(’velocity(deg/s)')

P OINT TO POINT MOTION Acceleration profile for cubic polynomial trajectory Matlab code: syms t; qddot= *t; t=[0:0.01:1]; plot(t,subs(qddot,t)) xlabel('Time sec') ylabel(’Acceleration(deg/s2)')

HW 1 A single link robot with a rotary joint is at Ө =15 ْ degrees. It is desired to move the joint in a smooth manner to Ө =75 ْ in 3 sec. Find the coefficeints of a cubic to bring the manipulator to rest at the goal.

E XAMPLE 2 Given the 6 constraints: (n=5)

P OINT TO POINT MOTION Quintic Trajectories 6 coefficients (6 constraints) Define the trajectory q(t) to be a polynomial of degree n The desired velocity: The desired acceleration:

P OINT TO POINT MOTION Evalautation of the a i coeff to satify the constaints

P OINT TO POINT MOTION Combined the six equations into a single matrix equation.

P OINT TO POINT MOTION Combined the six equations into a single matrix equation.