by Tullio Facchinetti
The webpage with information of the course 2021-22 is still available here.
2022-10-05: The schedule of the lessons of Prof. Howard Li have been published in this page.
The course on Robotics will be held by Prof. Tullio Facchinetti.
I recommend to carefully read the information reported in this page.
The course will be held in presence, unless the conditions will change during the course.
Contacts and appointments
To request for a meeting, and for any other issue, please send me an email.
Since I held/hold many different courses, I kindly ask to specify in the email the following information: name, course name, identification number, and - possibly - the year when the course was attended.
There are two lessons per week. The schedule is as follows:
- Tuesday, 11:00 - 13:00 (Room H2)
- Wednesday, 11:00 - 13:00 (Room 3 - Polo Nuovo)
The course includes 6 lessons held by Prof. Howard Li. The lessons will be held during one single week for organisational reasons. The schedule of the lessons is the following:
- Thursday, 15 December 09:00 - 11:00 (Seminar Room Magenta)
- Friday, 16 December 16:00 - 18:00 (Room C7)
- Tuesday, 20 December 11:00 - 13:00 (Room H2)
- Wednesday, 21 December 11:00 - 13:00 (Room 3)
- Wednesday, 21 December 16:00 - 18:00 (Room E3)
- Thursday, 22 December 09:00 - 11:00 (Seminar Room Magenta)
The Seminar Room Magenta is located at the D floor in the area with the laboratories of Electronics.
Short instructions to reach the Seminar Room:
- start in the entrance hall (in front of the cafeteria)
- points towards the corridor leading to rooms B1, B2, etc.
- take the first stairs on the right
- exit the stairs at the D floor
- enter the door on the right
- turn the corner on the left
- the seminar room is the last room on the right
Don’t use neither Bug 1 or Bug 2 algorithms: you are on a 3D environment!
Organization of the exam
The exam consists of a test regarding the topics covered during the course. The test will be delivered through the Kirotesting platform in any case. For this reason, if the exam is sustained in presence, it will be done in in the computer classrooms. The duration of the test is 2 hours.
To avoid problems on the day of the exam, it is recommended to make sure to be able to access the Robotics course in the Kirotesting platform using the student’s credentials.
The slides linked in this page contain all the material that is necessary for preparing the exam.
Further information regarding the exam:
- The topics of the seminars from Prof. Howard Li will be subject of open questions or exercises at the exam.
- The slides that are available online cover some topics that will not be explained during the lessons. These topics WILL NOT BE subject of questions or exercises at the exam.
Some examples of past exams are available. Although they are examples of questions to be replied on paper, and nowdays the exam is held using the Kirotesting online platform, the type of questions remains approximately the same. It only differs in the way the results have to be entered, which has been adapted to the online environment.
The didactic material is based on the slides shown during lessons. Additional material may be made available during the course.
ATTENTION: since slight changes to the slides are possible, it is recommended to periodically check this site for updates. The date indicated for each presentation represents the latest update of the corresponding file.
- [02/10/2021] Introduction : historical origins of robotics; overview of a robotics system; hardware and software components of a robot;
- [16/12/2021] Robot navigation : introduction; bugs algorithms: Bug 1, Bug 2, Tangent Bug; potential fields method;
- [02/10/2022] Map-based robot navigation : roadmaps; basics about graphs; visibility maps; grid-occupancy maps; wave-front algorithm; A* algorithm; probabilistic planners; Voronoi maps; cell decomposition maps;
Finite State Machines
- [08/12/2022] Finite State Machines : introduction; Mealy and Moore FSM; formal model; composition of state machines; hybrid systems; examples.
- [01/10/2019] Introduction : definitions; examples; terminology, definitions and notation; taxonomy;
- [15/01/2019] Classical algorithms : First-Come First-Served (FCFS), Shortest Job First (SJF), Round-Robin (RR), Earliest Due Date (EDD), Earliest Deadline First (EDF), optimality of EDF, non-preemptive scheduling.
- [13/01/2022] Periodic tasks : task model, Rate Monotonic (RM), Earliest Deadline First (EDF), Deadline Monotonic (DM).
- [11/12/2020] Aperiodic tasks : task model, background scheduling, Polling Server (PS), Sporadic Server (SS), Total Bandwidth Server (TBS), TBS*, Constant bandwidth Server (CBS).
- [11/12/2020] Shared resources : critical sections, Priority Inheritance Protocol (PIP).
- [05/11/2019] Measures : measurements, errors, propagation of errors, sources of errors.
- [08/12/2022] Introduction to sensors : type of sensors, characteristics of intelligent sensors.
- [08/01/2018] Sensors - part 1 : linear and angular position sensors; resistive (potentiometers and strain gauges), capacitive, inductive and optical (encoders) technologies; Gray code; gyroscopes; proximity sensors; ultrasonic sensors; touchscreen; GPS; trilateration and multilateration.
- [11/01/2022] Sensors - part 2 : pressure sensors; accelerometers; force sensors and cantilevers; load cell.
- [11/01/2022] Sensors - part 3 : flow sensors (Venturi and Pitot tubes); temperature sensors: thermocoupled resistive thermometers, thermistors; current sensors.
- [13/12/2016] Image sensors : relevance of image processing; CCD and CMOS sensors; efficient image processing algorithm.
- [14/12/2016] Time sensors : oscillators: equivalent circuit, clock, clock drift, parameters and properties, distributed synchronization; Network Time Protocol (NTP).
- [15/01/2021] Errors and compensation : types of errors; compensation techniques; polynomial functions; Look Up Table; Wheatstone bridge.
Additional references and material
- Python Robotics is a very nice collection of open source Python scripts that implement several algorithms related to path planning and other techniques. The available simulations are useful to get a visual understanding of the algorithm.
- A video on Youtube with a simulation of the Tangent Bug.
- A very good and detailed description of the A* algorithm can be found at the Amit’s A* Pages.
- A useful algorithm to construct a grid map from the obstacle edges is the Bresenham’s algorithm.
- A great page from Professor Howard Li reporting a number of links to videos, institutions, projects, software and more about robotics.
The following text books are helpful to expand the topics covered in the course.
- John Brignell, Neil White, “Intelligent Sensor System”, Institute of Physics Publishing, Bristol and Philadelphia, 1996. ISBN 0-7503-0389-1.
- Paulo Verissimo, Luis Rodriguez, “Distributed Systems for System Architects”, Kluwer Academis Publishers, 2000. ISBN 0-7923-7266-2.
- Giorgio C. Buttazzo, “Hard Real-time Computing System” Second Edition, Springer, 2005. ISBN 0-387-23137-4.
- Howie Choset, Kevin M. Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia E. Kavraki, Sebastian Thrun, “Principles of Robot Motion: Theory, Algorithms, and Implementations”, The MIT Press, Cambridge, Massachussets, 2005. ISN 0-262-03327-5.
- John R. Taylor, “An Introduction to Error Analysis: The Study of Uncertainties in Physical Measurements”, University Science Books, 1997.
- Edward A. Lee and Sanjit A. Seshia, Introduction to Embedded Systems, A Cyber-Physical Systems Approach, ISBN 978-0-557-70857-4, 2011.