Lecture

HMM - Applications to Robotics

In course
DEMO: in aute consequat
Ea voluptate veniam laboris excepteur anim enim proident deserunt cillum pariatur magna. Exercitation mollit culpa mollit fugiat in consequat ex nostrud ullamco in id deserunt reprehenderit sunt. Sunt eu Lorem dolore adipisicing sit exercitation et ullamco.
Login to see this section
Description

This lecture covers the Bayesian extension of Hidden Markov Models (HMM) to automatically segment and model sequences of actions in robots trained for cooking tasks. It discusses the limitations of classical finite HMMs for segmentation, the use of Bayesian Non-Parametrics for HMMs, and the Hierarchical Dirichlet Process prior on the transition matrix. The lecture also explores the segmentation of continuous motion capture data into motion categories and the learning of complex sequential tasks from demonstration, using a pizza dough rolling case study.

Instructor
ad id do
Enim ea ipsum incididunt qui. Elit nulla consectetur velit pariatur aute et cillum aliqua nostrud ea laborum eiusmod mollit culpa. Excepteur et et non exercitation deserunt veniam elit aliquip.
Login to see this section
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related lectures (36)
Hidden Markov Models (HMM): Theory
Covers Hidden Markov Models (HMM) for modeling time series data and decoding using the Viterbi Algorithm.
Markov Chains and Applications
Explores Markov chains, Ising Model, Metropolis algorithm, and Glauber dynamics.
Markov Chains and Algorithm Applications
Covers Markov chains and their applications in algorithms, focusing on Markov Chain Monte Carlo sampling and the Metropolis-Hastings algorithm.
NISQ and IBM Q
Explores NISQ devices and IBM Q, covering noisy quantum circuits, qubit technologies, and quantum algorithm development.
Monte Carlo Markov Chains
Covers Monte Carlo Markov Chains and sampling algorithms for iterative trial configurations.
Show more