learning for professionals

Artificial Intelligence

AI Search Methods for Mobile Robots

The promise of intelligent robot systems is that they can accomplish more tasks, more efficiently than a single-purpose industrial robotic solution. Intelligent robots act competently because they can plan, sequence and enact the actions that are appropriate in the context in which they find themselves. In order to achieve this capability, intelligent robots use Artificial Intelligence (AI) Search Methods. These are general-purpose algorithms for solving combinatorial problems, in other words, they constitute a robot's "reasoning engine". This course introduces students to the most important types of AI search methods. These are then instantiated in three industrially-relevant application contexts, namely, resource scheduling, motion planning, and multi-robot coordination.

Autonomous Robots and ROS

ROS (Robot Operating System) is a common set of tools used in academia to do research within autonomous systems. It shortly provides a middleware for handling communication, as well as interfacing sensors and actuators, visualization, simulation and datalogging and infrastructure where it is easy to share your own methods and algorithms. The latter has allowed a large set of different of state-of-the-art research approaches to be readily available for downloading. Due to its popularity it is also getting more widespread in the industrial community, especially in R&D. This course will give you hands-on experience how to utilize these tools and apply them to a problem of your choice.

Declarative Problem Solving with Answer Set Programming

Answer Set Programming (ASP) is a declarative programming paradigm designed within the field of Artificial Intelligence (AI), and used to solve complex search-problems. The declarative nature of ASP allows one to encode a problem by means of logic. In this way, unlike in imperative programming approaches, there is no need to design an algorithm as a solution for the given problem. In this sense, ASP is comparable with SAT-based encoding or constraint satisfaction problems. However, due to its stable-model semantics, ASP provides a richer representation language useful to handle uncertain situations more effectively for real world scenarios. The advantages of declarative programming together with non-monotonic nature of ASP in handling uncertainties have recently made ASP more attractive both for academia and industry. This course focuses on formalizing and solving various search problems in planning, scheduling and system configuration in ASP.