SYS 7042 - Heuristic Search

Effective Start Date: 08/01/2023
Characterization and analysis of problem solving strategies guided by heuristic information. The course links material from optimization, intelligence systems, and complexity analysis. Formal development of the methods and complete discussion of applications, theoretical properties, and evaluation. Methods discussed include best-first strategies for OR and AND/OR graphs, simulated annealing, genetic algorithms and evolutionary programming, tabu search, and tailored heuristics. Applications of these methods to engineering design, scheduling, signal interpretation, and machine intelligence. Prerequisite: SYS 6005 or instructor permission.

Credits: 3
Grading Basis: Satisfactory/Unsatisfactory