Skip to main content
Log in
Čeština ‎(cs)‎ English ‎(en)‎
Documentation
Čeština ‎(cs)‎ English ‎(en)‎

Optimal and Robust Control

BE3M35ORR + B3M35ORR + BE3M35ORC
  1. Home
  2. Courses
  3. BE3M35ORR, B3M35ORR, BE3M35ORC - B232
  4. 26 February - 3 March
  5. Homework problem assignment #2
This course is part of an already archived semester and is therefore read-only.

Homework problem assignment #2

Completion requirements
Due: Wednesday, 6 March 2024, 11:00 AM

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
    12 January 2024, 11:53 PM
◄ Solutions for the exercises given in the seminar
Learning goals ►
ORR
Optimal and Robust Control
B232 B232 - Summer 23/24
B162 - Summer 16/17 B172 - Summer 17/18 B182 - Summer 18/19 B192 - Summer 19/20 B202 - Summer 20/21 B212 - Summer 21/22 B222 - Summer 22/23 B242 - Summer 24/25

Grades Teachers Participants
 Contact us  Reset user tour on this page
© 2025 Center for Knowledge Management
Useful links
Faculty website Calendar Study department FELSight Moodle API
Navigation
Log in
CTU logo