Skip to content

Path Planning

francescodelduchetto edited this page Mar 27, 2025 · 5 revisions

Task 1 - cartesian path

In this task, you will implement a very simple path planning algorithm for a set of target Cartesian coordinates.

  1. ▶️ 🧑‍💻 Open the script week8/trajectory_planning.py and go to the function plan_cartesian_trajectory(self) which contains a template for solving the task.
  2. ▶️ 🧑‍💻 Complete the missing parts of the code. NOTE 1: the functionalities for plotting your path are already implemented. NOTE 2: you can use the function compute_ik(target_P, target_R, elbow_up) from inverse_kinematics_analytic.py in order to compute the joint positions.

Task 2 - joint path

In this task you will implement a very simple path planning algorithm for a set of target joint coordinates.

  1. ▶️ 🧑‍💻 Similarly as before, open the script week8/trajectory_planning.py and go to the function plan_joint_trajectory(self) which contains a template for solving the task.
  2. ▶️ 🧑‍💻 Complete the missing parts of the code. NOTE 1: the functionalities for plotting your path are already implemented. NOTE 2: you can use the function compute_dk(q1,q2,q3,q4,q5,q6) from direct_kinematics.py in order to compute the end effector position.

2024/2025

Syllabus

2023/2024

Syllabus

Clone this wiki locally