Přejít k hlavnímu obsahu
Přihlásit se
Čeština ‎(cs)‎ English ‎(en)‎
Dokumentace
Čeština ‎(cs)‎ English ‎(en)‎

Optimal and Robust Control

B3M35ORR + BE3M35ORR + BE3M35ORC
  1. Titulní stránka
  2. Kurzy
  3. BE3M35ORR, B3M35ORR, BE3M35ORC - B212
  4. 21. února - 27. února
  5. Homework problem assignment #2
Tento kurz je součástí již archivovaného semestru, a proto je dostupný pouze pro čtení.

Homework problem assignment #2

Požadavky na absolvování
Termín: středa, 2. března 2022, 14.30

Inverse Kinematics Problem by Quasi-Newton Methods

Solve numerically the inverse kinematics problem for the 4-link planar robot visualized in the figure below. An inverse kinematics problem is a problem where you are given a position of the end effector (e.g. a gripper) of a robot and your goal is to find such joint coordinates—for instance, angles in case of rotational joints—that the robot's end effector ends up in the required position. Without delving into details, let us state that some inverse kinematics problems have closed-form solutions (you can solve them analytically) and some do not. For the latter case, you have to invoke numerical methods. That is exactly what you will be dealing with in this homework assignment.


There are more ways how to solve inverse kinematics problems numerically, nevertheless, you are required to solve the particular problem of this homework assignment by the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm. This algorithm belongs to the family of so-called quasi-Newton methods which do not compute the Hessian of the objective function exactly (as opposed to Newton methods) but only approximatively based on the gradient of the objective function (which can be estimated by numerical differentiation, if not available). 

Download the attached hw2_cvutID.m file and get familiar with the code in it. All the supporting function—like a plotting function, forward kinematics function, and objective function—has been already implemented. The only missing part is an implementation of the BFGS algorithm. Hence, your task is to implement the BFGS algorithm to the attached hw2_cvutID.m, replace cvutID in the name of the file and the name of the main function by your actual KOS username, and submit the modified file as the solution of this homework assignment. You can submit only one m-file. If you need more functions, you can use nested functions (for details, see this).

  • hw2_cvutID.m hw2_cvutID.m
    24. ledna 2022, 01.17
◄ Solutions for the exercises given in the seminar
Learning goals ►
ORR
Optimal and Robust Control
B212 B212 - Letní 21/22
B162 - Letní 16/17 B172 - Letní 17/18 B182 - Letní 18/19 B192 - Letní 19/20 B202 - Letní 20/21 B222 - Letní 22/23 B232 - Letní 23/24 B242 - Letní 24/25

Známky Vyučující Účastníci
 Kontaktujte nás  Spustit znovu Průvodce uživatele
© 2025 Centrum znalostního managementu
Užitečné odkazy
Web fakulty Harmonogram Studijní oddělení FELSight Moodle API
Navigace
Přihlásit se
CTU logo