Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Probabilistic Robotics - NAIX101

Title:	Pravděpodobnostní robotika
Guaranteed by:	Student Affairs Department (32-STUD)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2022
Semester:	summer
E-Credits:	6
Hours per week, examination:	summer s.:2/2, C+Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time
Is provided by:	NAIL101
Additional information:	http://ktiml.mff.cuni.cz/~obdrzalek/vyuka/NAIL101/

Guarantor:	RNDr. David Obdržálek, Ph.D.
Class:	Informatika Mgr. - volitelný
Classification:	Informatics > Software Engineering
Pre-requisite :	{NXXX038, NXXX039, NXXX040, NXXX067, NXXX069}
Incompatibility :	NAIL101
Interchangeability :	NAIL101

Opinion survey results Examination dates SS schedule Noticeboard

Annotation -

Last update: T_KSI (13.05.2010)

During its life a robot deals with many problems: It wakes up - without knowing where it is. It is going - without knowing how and where. It is doing - without knowing what and why. These difficulties come from an inaccuracy of sensors and from a complexity of the real world, which cannot be accurately captured by a simple model. Our goal for this class is to familiarize ourselves with various algorithmic methods, which help us with dealing with the uncertainty originating from our and robot's ignorance.

Aim of the course -

Last update: Mgr. Marta Vomlelová, Ph.D. (09.05.2023)

The goal of this course is to get familiar with uncertainity representation and processing with respect to robotics.

Course completion requirements -

Last update: Mgr. Marta Vomlelová, Ph.D. (09.05.2023)

The form of study verification is a credit and an exam.

The credit is granted for submitted solutions to task presented during exercises. The nature of study verification for the credit excludes the possibility of its repetition.

The exam is oral. The demands correspond to the syllabus of the course in the extend that has been presented on lectures and exercises.

Literature - Czech

Last update: T_KSI (13.05.2010)

S. Thrun, W. Burgard, D. Fox: Probabilistic Robotics, MIT Press, 2005

S. Russel, P. Norvig: Artificial Intelligence: A Modern Approach, 3. vydání, Prentice Hall, 2009 (vybrané kapitoly)

Syllabus -

Last update: T_KSI (13.05.2010)

A reminder of probability theory

Kalman filters and their variants

Particle filters

Probabilistic localization and mapping

Decisioning and planning under uncertainty