Basics of Trajectory Planning
Introduction
In the previous topics, we studied the kinematics and dynamics of
robots.
This means that, using the equations of motion of the robot, we
can determine where the robot will be if we have the joint variables
or we can determine what the joint variables must be in order to
place the robot at a desired position and orientation with a desired
velocity.
Path and trajectory planning relates to the way a robot is moved
from one location to another in a controlled manner.
Introduction...
In trajectory planning, we will study the sequence of movements
that must be made to create a controlled movement between motion
segments, whether in straight-line motions or sequential motions.
Path and trajectory planning requires the use of both kinematics
and dynamics of robots.
In practice, precise motion requirements are so intensive that
approximations are always necessary.
Path Vs Trajectory
❖ A path is defined as the collection of a sequence of configurations
a robot makes to go from one place to another without regard to
the timing of these configurations.
❖ A trajectory is related to the timing at which each part of the path
must be attained.
❖ Therefore, the points at which the robot may be on a path and on
a trajectory at a given time may be different, even if the robot
traverses the same points.
Path Vs Trajectory...
In Figure 5.1, if a robot goes from point (configuration) A to
point B to point C, the sequence of the configurations between A
and B and C constitutes a path.
Path Vs Trajectory...
A trajectory is related to the timing at which each part of the path must
be attained.
As a result, regardless of when points B and C in Figure 5.1 are
reached, the path is the same, whereas depending on how fast each
portion of the path is traversed, the trajectory may differ.
Therefore, the points at which the robot may be on a path and
on a trajectory at a given time may be different, even if the robot
traverses the same points.
On a trajectory, depending on the velocities and accelerations,
points B and C may be reached at different times, creating
different trajectories.
Joint-Space Vs Cartesian-Space descriptions
Consider a 6-axis robot at a point A in space, which is directed to
move to another point B. Using the inverse kinematic equations of the
robot, we may calculate the total joint displacements the robot needs to
makes to get to the new location. The joint values thus calculated can
be used by the controller to drive the robot joints to their new values
and, consequently move the robot arm to its new position.
The description of the motion to be made by the robot by its joint
values is called joint-space description.
Joint-Space Vs Cartesian-Space descriptions
Consider again robot move from A and B in a straight line. Divide the
line into small portions as shown in figure and move robot through all
intermediate points. We use inverse kinematic equations, and controller
is directed to drive the robot to those values.
The Cartesian-space description is much more computationally
intensive than the joint-space description, but yields a controlled and
known path.
• Both joint-space and Cartesian-space descriptions are very useful
and are used in industry.
Joint-Space Vs Cartesian-Space descriptions
Sequential motions of a robot to follow a straight line
Joint-Space Vs Cartesian-Space descriptions
❖ Both joint-space and Cartesian-space descriptions are very useful
and are used in industry.
❖ Cartesian-space trajectories are very easy to visualize.
❖ Since the trajectories are in the common Cartesian space in which we
all operate, it is easy to visualize what the end effector’s trajectory
must be.
❖ Cartesian-space trajectories are computationally expensive and
require a faster processing time for similar resolution than joint-space
trajectories.
❖ Additionally, although it is easy to visualize the trajectory, it is difficult
to visually ensure that singularities will not occur.
Joint-Space Vs Cartesian-Space descriptions
Cartesian-space trajectory problems. In (a), the trajectory specified in
Cartesian coordinates may force the robot to run into itself; in (b), the
trajectory may require a sudden change in the joint angles.
Workspace estimation and path planning.pdf
Basics of Trajectory Planning
Case 1
To move the robot from point A to point B.
The configuration of the robot at point A is shown, with 𝛼 =20° and
𝜷=30°
Suppose it has been calculated that in order for the robot to be at
point B, it must be at 𝛼 =40° and 𝜷=80°
Also suppose that both joints of the robot can move at the maximum
rate of 10 degrees/sec.
Basics of Trajectory Planning...
Case1: Solution
One way to move the robot from point A to B is to run both joints at
their maximum angular velocities.
This means that at the end of the second time interval, the lower link
of the robot will have finished its motion, while the upper link
continues for another three seconds
The trajectory of the end of the robot is also shown.
As indicated, the path is irregular, and the distances traveled by the
robot’s end are not uniform.
Basics of Trajectory Planning...
Joint-space, non-normalized movements of a 2-DOF robot
Basics of Trajectory Planning...
Case 2:
Now suppose the motions of both joints of the robot are normalized
such that the joint with smaller motion will move proportionally
slower so that both joints will start and stop their motion
simultaneously.
In this case, both joints move at different speeds, but move
continuously together.
• 𝛂 changes 4 degrees/second while 𝞫 changes 10 degrees/second.
Basics of Trajectory Planning...
Joint-space, normalized movements of a robot with 2 DOF
Basics of Trajectory Planning...
❖ Notice that the segments of the movement are much more
similar to each other than before, but the path is still irregular
(and different from the previous case).
❖ Both of these cases were planned in joint-space as we were
only concerned with the values of the joints, not the location of
the end of the mechanism.
❖ The only calculation needed was the joint values for the
destination and, in the second case, normalization of the joint
velocities
Basics of Trajectory Planning...
❖ Now suppose we want the robot’s hand to follow a known path
between points A and B, say, in a straight line.
❖ The simplest solution would be to draw a line between points A and
B, divide the line into, say, 5 segments, and solve for necessary
angles 𝛼 and 𝜷 at each point.
❖ This is called interpolation between points A and B.
❖ Notice that in this case, the path is a straight line, but the joint
angles are not uniformly changing.
Workspace estimation and path planning.pdf
Basics of Trajectory Planning...
❖ Although the resulting motion is a straight (and consequently,
known) trajectory, it is necessary to solve for the joint values at each
point.
❖ Obviously, many more points must be calculated for better
accuracy; with so few segments the robot will not exactly follow the
lines at each segment.
❖ This trajectory is in Cartesian-space since all segments of the
motion must be calculated based on the information expressed in a
Cartesian frame.
❖ In this case, it is assumed that the robot’s actuators are strong
enough to provide the large forces necessary to accelerate and
decelerate the joints as needed.
Basics of Trajectory Planning...
Assume robot is to go from A to B and then C. Blended path reduces
the stress on the robot and requires less energy. Due to blending, the
robot will go through a different point B1 and not B (fig a). To exactly
through B,then specify different point B’’ (fig b).
Basics of Trajectory Planning...
An alternative scheme for ensuring that the robot will go through a
specified point during blending of motion segments. Two via points C
and D are picked such that point B will fall on the straight-line section
of the segment ensuring that the robot will pass through point B.

More Related Content

PPTX
Chapter_5_-_Trajectory_Planning _Dr. Mustafa K. Uyguroğlu.pptx
PPTX
Manipuladores robóticos em sistemas espaciais
PDF
Robotics Simulation by Wireless Brains - ROBOKDC'15 Project
PDF
090RobotTrajectoryGenerationEn.pdf
PDF
Two Link Robotic Manipulator
PPTX
Lecture2
PDF
KOM UNIT 2.1-2.pdf
PPTX
Robotics lec 6
Chapter_5_-_Trajectory_Planning _Dr. Mustafa K. Uyguroğlu.pptx
Manipuladores robóticos em sistemas espaciais
Robotics Simulation by Wireless Brains - ROBOKDC'15 Project
090RobotTrajectoryGenerationEn.pdf
Two Link Robotic Manipulator
Lecture2
KOM UNIT 2.1-2.pdf
Robotics lec 6

Similar to Workspace estimation and path planning.pdf (20)

PDF
Lecture 1 trajectory generation
PDF
Research on The Control of Joint Robot Trajectory
PDF
lec 2 Robotics time & motion
PDF
Robust Control of a Spherical Mobile Robot
PDF
Experimental Comparison of Trajectory Planning Algorithms for Wheeled Mobile ...
PPTX
Module 4 Path Planning, Navigation _Robotics
PPTX
Unit IV.pptx Robot programming and Languages
PDF
04 mobile robot vehicles
PDF
DESIGN AND IMPLEMENTATION OF PATH PLANNING ALGORITHM
PDF
acc hjbvyu NIH Junio Khoi knit Khoi,; jupon l
PDF
RoboticsMotionPlanning
PPT
Robotics: Introduction to Kinematics
PPTX
DOC-20230926-WA0002..pptx
PDF
Robotics unit4 slides
DOC
Last docx
PDF
RMV Mechanics
PDF
3. Motion in a straight line ppt.pdf by me
PDF
Jacobian inverse manipulator
PPT
Chapter 2 - Robot Kinematics.ppt
PPTX
2 planning of manipulator trajectories control and kinematics
Lecture 1 trajectory generation
Research on The Control of Joint Robot Trajectory
lec 2 Robotics time & motion
Robust Control of a Spherical Mobile Robot
Experimental Comparison of Trajectory Planning Algorithms for Wheeled Mobile ...
Module 4 Path Planning, Navigation _Robotics
Unit IV.pptx Robot programming and Languages
04 mobile robot vehicles
DESIGN AND IMPLEMENTATION OF PATH PLANNING ALGORITHM
acc hjbvyu NIH Junio Khoi knit Khoi,; jupon l
RoboticsMotionPlanning
Robotics: Introduction to Kinematics
DOC-20230926-WA0002..pptx
Robotics unit4 slides
Last docx
RMV Mechanics
3. Motion in a straight line ppt.pdf by me
Jacobian inverse manipulator
Chapter 2 - Robot Kinematics.ppt
2 planning of manipulator trajectories control and kinematics
Ad

Recently uploaded (20)

PPTX
CyberSecurity Mobile and Wireless Devices
PDF
Influence of Green Infrastructure on Residents’ Endorsement of the New Ecolog...
PDF
UEFA_Embodied_Carbon_Emissions_Football_Infrastructure.pdf
PPTX
Management Information system : MIS-e-Business Systems.pptx
PPTX
Amdahl’s law is explained in the above power point presentations
PPTX
AUTOMOTIVE ENGINE MANAGEMENT (MECHATRONICS).pptx
PPTX
mechattonicsand iotwith sensor and actuator
PPTX
tack Data Structure with Array and Linked List Implementation, Push and Pop O...
PPTX
Information Storage and Retrieval Techniques Unit III
PDF
20250617 - IR - Global Guide for HR - 51 pages.pdf
PPT
Chapter 1 - Introduction to Manufacturing Technology_2.ppt
PPTX
Software Engineering and software moduleing
PPTX
A Brief Introduction to IoT- Smart Objects: The "Things" in IoT
DOC
T Pandian CV Madurai pandi kokkaf illaya
PDF
August -2025_Top10 Read_Articles_ijait.pdf
PPTX
PRASUNET_20240614003_231416_0000[1].pptx
PPTX
ai_satellite_crop_management_20250815030350.pptx
PPTX
Graph Data Structures with Types, Traversals, Connectivity, and Real-Life App...
PPTX
Principal presentation for NAAC (1).pptx
PDF
MLpara ingenieira CIVIL, meca Y AMBIENTAL
CyberSecurity Mobile and Wireless Devices
Influence of Green Infrastructure on Residents’ Endorsement of the New Ecolog...
UEFA_Embodied_Carbon_Emissions_Football_Infrastructure.pdf
Management Information system : MIS-e-Business Systems.pptx
Amdahl’s law is explained in the above power point presentations
AUTOMOTIVE ENGINE MANAGEMENT (MECHATRONICS).pptx
mechattonicsand iotwith sensor and actuator
tack Data Structure with Array and Linked List Implementation, Push and Pop O...
Information Storage and Retrieval Techniques Unit III
20250617 - IR - Global Guide for HR - 51 pages.pdf
Chapter 1 - Introduction to Manufacturing Technology_2.ppt
Software Engineering and software moduleing
A Brief Introduction to IoT- Smart Objects: The "Things" in IoT
T Pandian CV Madurai pandi kokkaf illaya
August -2025_Top10 Read_Articles_ijait.pdf
PRASUNET_20240614003_231416_0000[1].pptx
ai_satellite_crop_management_20250815030350.pptx
Graph Data Structures with Types, Traversals, Connectivity, and Real-Life App...
Principal presentation for NAAC (1).pptx
MLpara ingenieira CIVIL, meca Y AMBIENTAL
Ad

Workspace estimation and path planning.pdf

  • 2. Introduction In the previous topics, we studied the kinematics and dynamics of robots. This means that, using the equations of motion of the robot, we can determine where the robot will be if we have the joint variables or we can determine what the joint variables must be in order to place the robot at a desired position and orientation with a desired velocity. Path and trajectory planning relates to the way a robot is moved from one location to another in a controlled manner.
  • 3. Introduction... In trajectory planning, we will study the sequence of movements that must be made to create a controlled movement between motion segments, whether in straight-line motions or sequential motions. Path and trajectory planning requires the use of both kinematics and dynamics of robots. In practice, precise motion requirements are so intensive that approximations are always necessary.
  • 4. Path Vs Trajectory ❖ A path is defined as the collection of a sequence of configurations a robot makes to go from one place to another without regard to the timing of these configurations. ❖ A trajectory is related to the timing at which each part of the path must be attained. ❖ Therefore, the points at which the robot may be on a path and on a trajectory at a given time may be different, even if the robot traverses the same points.
  • 5. Path Vs Trajectory... In Figure 5.1, if a robot goes from point (configuration) A to point B to point C, the sequence of the configurations between A and B and C constitutes a path.
  • 6. Path Vs Trajectory... A trajectory is related to the timing at which each part of the path must be attained. As a result, regardless of when points B and C in Figure 5.1 are reached, the path is the same, whereas depending on how fast each portion of the path is traversed, the trajectory may differ.
  • 7. Therefore, the points at which the robot may be on a path and on a trajectory at a given time may be different, even if the robot traverses the same points. On a trajectory, depending on the velocities and accelerations, points B and C may be reached at different times, creating different trajectories.
  • 8. Joint-Space Vs Cartesian-Space descriptions Consider a 6-axis robot at a point A in space, which is directed to move to another point B. Using the inverse kinematic equations of the robot, we may calculate the total joint displacements the robot needs to makes to get to the new location. The joint values thus calculated can be used by the controller to drive the robot joints to their new values and, consequently move the robot arm to its new position. The description of the motion to be made by the robot by its joint values is called joint-space description.
  • 9. Joint-Space Vs Cartesian-Space descriptions Consider again robot move from A and B in a straight line. Divide the line into small portions as shown in figure and move robot through all intermediate points. We use inverse kinematic equations, and controller is directed to drive the robot to those values. The Cartesian-space description is much more computationally intensive than the joint-space description, but yields a controlled and known path. • Both joint-space and Cartesian-space descriptions are very useful and are used in industry.
  • 10. Joint-Space Vs Cartesian-Space descriptions Sequential motions of a robot to follow a straight line
  • 11. Joint-Space Vs Cartesian-Space descriptions ❖ Both joint-space and Cartesian-space descriptions are very useful and are used in industry. ❖ Cartesian-space trajectories are very easy to visualize. ❖ Since the trajectories are in the common Cartesian space in which we all operate, it is easy to visualize what the end effector’s trajectory must be. ❖ Cartesian-space trajectories are computationally expensive and require a faster processing time for similar resolution than joint-space trajectories. ❖ Additionally, although it is easy to visualize the trajectory, it is difficult to visually ensure that singularities will not occur.
  • 12. Joint-Space Vs Cartesian-Space descriptions Cartesian-space trajectory problems. In (a), the trajectory specified in Cartesian coordinates may force the robot to run into itself; in (b), the trajectory may require a sudden change in the joint angles.
  • 14. Basics of Trajectory Planning Case 1 To move the robot from point A to point B. The configuration of the robot at point A is shown, with 𝛼 =20° and 𝜷=30° Suppose it has been calculated that in order for the robot to be at point B, it must be at 𝛼 =40° and 𝜷=80° Also suppose that both joints of the robot can move at the maximum rate of 10 degrees/sec.
  • 15. Basics of Trajectory Planning... Case1: Solution One way to move the robot from point A to B is to run both joints at their maximum angular velocities. This means that at the end of the second time interval, the lower link of the robot will have finished its motion, while the upper link continues for another three seconds The trajectory of the end of the robot is also shown. As indicated, the path is irregular, and the distances traveled by the robot’s end are not uniform.
  • 16. Basics of Trajectory Planning... Joint-space, non-normalized movements of a 2-DOF robot
  • 17. Basics of Trajectory Planning... Case 2: Now suppose the motions of both joints of the robot are normalized such that the joint with smaller motion will move proportionally slower so that both joints will start and stop their motion simultaneously. In this case, both joints move at different speeds, but move continuously together. • 𝛂 changes 4 degrees/second while 𝞫 changes 10 degrees/second.
  • 18. Basics of Trajectory Planning... Joint-space, normalized movements of a robot with 2 DOF
  • 19. Basics of Trajectory Planning... ❖ Notice that the segments of the movement are much more similar to each other than before, but the path is still irregular (and different from the previous case). ❖ Both of these cases were planned in joint-space as we were only concerned with the values of the joints, not the location of the end of the mechanism. ❖ The only calculation needed was the joint values for the destination and, in the second case, normalization of the joint velocities
  • 20. Basics of Trajectory Planning... ❖ Now suppose we want the robot’s hand to follow a known path between points A and B, say, in a straight line. ❖ The simplest solution would be to draw a line between points A and B, divide the line into, say, 5 segments, and solve for necessary angles 𝛼 and 𝜷 at each point. ❖ This is called interpolation between points A and B. ❖ Notice that in this case, the path is a straight line, but the joint angles are not uniformly changing.
  • 22. Basics of Trajectory Planning... ❖ Although the resulting motion is a straight (and consequently, known) trajectory, it is necessary to solve for the joint values at each point. ❖ Obviously, many more points must be calculated for better accuracy; with so few segments the robot will not exactly follow the lines at each segment. ❖ This trajectory is in Cartesian-space since all segments of the motion must be calculated based on the information expressed in a Cartesian frame. ❖ In this case, it is assumed that the robot’s actuators are strong enough to provide the large forces necessary to accelerate and decelerate the joints as needed.
  • 23. Basics of Trajectory Planning... Assume robot is to go from A to B and then C. Blended path reduces the stress on the robot and requires less energy. Due to blending, the robot will go through a different point B1 and not B (fig a). To exactly through B,then specify different point B’’ (fig b).
  • 24. Basics of Trajectory Planning... An alternative scheme for ensuring that the robot will go through a specified point during blending of motion segments. Two via points C and D are picked such that point B will fall on the straight-line section of the segment ensuring that the robot will pass through point B.