Stochastic Information Processing

Content

To deal with complex dynamic systems, as they occur for example in robotics, one typically requires both system models and the temporal evolution of the system states. For both system identification and state reconstruction, however, usually only noisy data are available. 

For continuous state spaces, an exact calculation of the probability densities is only possible in a few special cases. In practice, general nonlinear systems are often traced back to these special cases by simplifying assumptions. One extreme is linearization with subsequent application of linear estimation theory. However, this often leads to unsatisfactory results and requires additional heuristic measures. At the other extreme are numerical approximation methods, which only evaluate the desired probability densities at discrete points in the state space. Although the basic principle of these methods is usually quite simple, their practical implementation is often difficult and, in particular for higher-dimensional systems, computationally demanding. 

As a middle ground, analytical nonlinear estimation methods would therefore often be desirable. In this lecture the main difficulties in the development of such estimation methods are outlined and corresponding solution modules are presented. Based on these building blocks, some analytical estimation methods are discussed in detail as examples, which are very suitable for practical implementation and offer a good compromise between computing effort and performance. Useful applications of these estimation methods are also discussed. Both known methods and the results of current research are presented. 

Language of instruction English
Bibliography

Further Reading

Lecture Notes

Organisational issues

Please arrange the exam date via email. Don't forget to register separately in im CAS