Warning

This page is located in archive.
Go to the latest version of this course pages.
Go the latest version of this page.

BRUTE I S CZEN F: 18 16 15 14 13 12

*,,Drahá slečno Gloryová, Roboti nejsou lidé. Jsou mechanicky dokonalejší než my, mají úžasnou rozumovou inteligenci, ale nemají duši. Ó, slečno Gloryová, výrobek inženýra je technicky vytříbenější než výrobek přírody.“* - Karel Čapek, R.U.R.

[*“Miss Glory, robots are not people. They are mechanically much better than we are, they have an amazing ability to understand things, but they don't have a soul. Young Rossum created something much more sophisticated than Nature ever did - technically at least!”*]

We will explain some fundamental notions appearing in advanced robotics. We shall, e.g., learn how to solve the inverse kinematics task of a general serial manipulator with 6 degrees of freedom. There is a general solution to this problem but it can't easily be obtained by elementary methods. We shall present some more advanced algebraic tools for solving algebraic equations. We will also pay special attention to representing and parameterizing rotations and motions in 3D space. We will solve simulated problems as well as problems with real data in labs and assignments.

Lecturers: Tomáš Pajdla, Čeněk Albl, Michal Polic, Vladimír Smutný, Pavel Trutman

Week | Date | Content |
---|---|---|

01 | 01.10. | VS: Introduction, algebraic equations and eigenvalues |

02 | 08.10. | VS: Denavit-Hartenberg Convention |

03 | 15.10. | CA: Motion as a transformation of coordinates, rotation matrix R |

04 | 22.10. | CA: R's eigenvalues, rotation axis |

05 | 29.10. | CA: R's eigenvectors, and angle |

06 | 05.11. | MP: Axis of motion |

07 | 12.11. | MP: Rodriguez parameterization, Angle-axis representation |

08 | 19.11. | MP: Quaternions, Cayley parameterization, Rational rotations |

09 | 26.11. | PT: Monomial ordering & polynomial division & "F4-like" algorithm for solving Polynomial equations |

10 | 03.12. | PT: Inverse kinematics computation |

11 | 10.12. | TP: Groebner basis and Buchberger algorithm I |

12 | 17.12. | TP: Groebner basis and Buchberger algorithm II |

13 | 07.01. | TP: Kinematics calibration & singularities |

Teachers: Pavel Trutman, Stanislav Steidl

See Exercises for details.

Grading (2016)

- All home works must be submitted and accepted (0 in the column ~HW)
- At least 50% of points in total from the home works (at least 0,5 in the column HW).
- At least 50% of points in total from the tests (at least 0,5 in the column T).
- Regular submission of home works ends on 07 Jan 2019. Later submissions are possible only by agreement with teaching assistants.
- All the above conditions have to be fulfilled and the results have to be recorded in the Submission system before coming to the exam.

The exam consists of a written and an oral part. It is required to achieve at least 50% of points from the written exam to be admitted to the oral exam.

Exam content:

**Linear algebra:**linear space, basis, coordinates, linear dependence/independence, matrices, rank, determinant, eigenvalues and eigenvectors, solving systems of linear equations, Frobenius theorem and linear independence, linear function, affine function, linear mapping and its matrix, computing roots of a polynomial via eigenvalues of its companion matrix, dual space, dual basis, change of the dual basis corresponding to a change of a basis, vector product and derived linear mappings.**Course material:**PRO-Lecture.pdf.

**Lecture:**It is very**difficult**to pass the course without attending lectures.**Exercises:**It is**impossible**to pass the course without attending labs.**Home works:**Home works are assigned at a lab where they can be discussed with teaching assistants. Students work out homweorks**individually**(rulesin Czech). The deadline for submitting a homework is on Monday 6:00 in the morning two weeks after the assignment. Late submissions are penalized (10% for each commenced day of delay but not more than 50% of points).**Assesment:**see above.**Tests:**Students work out test**independently**.**The final grade:**depends on the exam (40%), tests (30%), and home works (30%). The ratios may be slightly adjusted according to the relative difficulty of the home works and tests.

- Math Doctor Bob. Math Instruction Online. In Plain Language.
- Lung-Wen Tsai. Robot Analysis And Design: The Mechanics of Serial And Parallel Manipulators, John Wiley and Sons, 1999.
- P. Pták. Introduction to Linear Algebra. Vydavatelství ČVUT, Praha, 2007.
- E. Krajník. Maticový počet. Vydavatelství ČVUT, Praha, 2000.
- D. Cox, J. Little, D. O'Shea. Ideals, Varieties, and Algorithms. 2nd edition, Springer, 1998.
- Maple - A0B01MVM Matematika v Maple Maple download

- A0B01LAG Linear Algebra (must have)
- A3B33ROB Robotics (nice to have)

Tomáš Pajdla | Čeněk Albl | Michal Polic | Pavel Trutman | Vladimír Smutný |

`pajdla@cvut.cz` | `albl@cvut.cz` | `polic@cvut.cz` | `pavel.trutman@cvut.cz` | `smutny@cvut.cz` |

CIIRC B-638 | CIIRC B-640A | CIIRC B-640B | CIIRC B-637a | CIIRC B-608b |

courses/pro/start.txt · Last modified: 2018/12/10 01:00 by pajdla