AAAI 2020 Tutorial on Heuristic Search
Tutorial Overview| Materials| About the Presenters
The aim of the tutorial is to give a survey of selected recent directions in search, and by providing three speakers we will ensure a diverse set of topics and viewpoints. The tutorial will have several focus areas, each given by a speaker whose personal research has focused on the given area. Throughout this tutorial, we aim to highlight the different characteristics of different search problems and indicate which search methods are used for explicit (polynomial) domains and implicit (exponential) domains.

Title: Heuristic Search
Date: Friday, February 7
Time: 8:30-12:30
Location: Regent

Tentative Schedule

Part I: Brief Introduction and Overvew [10 minutes]

Part II: Baseline Algorithms with Examples [1hr 35 minutes]
Coffee Break - 30 min - 10:15 - 10:45
Part III: Bidirectional Search [50 minutes] Part IV: Multi-Agent Path Planning [50 minutes]