Lecture: Suchalgorithmen (Search Algorithms) - Details
You are not logged into Stud.IP.

Module assignments


The course will introduce search algorithms as a means to solve combinatorial problems such as constraint satisfaction and optimization problems. Tackling such problems by a machine often follows a two-step approach: (1) definition of a space of solution candidates plus (2) intelligent exploration of this space. The students will learn to analyze the nature of search problems, this way being able to devise adequate search space representations. We will cover the modeling of search problems, basic (uninformed) search algorithms, informed search algorithms, as well as hybrid combinations. A special focus will be put on heuristic search approaches. The lecture introduces concepts, algorithms, and theoretical backgrounds.