AAMAS 2019 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. In particular, we aim to focus on the following areas: 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: Tuesday, May 14
Time: 2:00pm - 6:00pm
Location: MB 3.445
Schedule: 2:00-3:30pm Parts I and II. 4:00-6:00pm Parts III-V

Part I: Brief Introduction and Overvew [10 minutes] (Nathan Sturtevant)

Part II: Baseline Algorithms with Examples [75 minutes] (Nathan Sturtevant, Daniel Harabor and Sven Koenig)
Coffee Break - 30 min
Part III: Preprocessing and Constraints [35 minutes] (Nathan Sturtevant, Daniel Harabor & Sven Koenig) Part IV: Any-Angle Search in 2D [60 minutes] (Sven Koenig and Daniel Harabor) Part V: Multi-Agent Path Planning [25 minutes] (Sven Koenig and Daniel Harabor)