MA-INF 1318 Theoretical Aspects of Intruder Search

News

For the first oral exams we offer two time slots: Namely February 16th or March 1st. The exams take place at LBH, room E01, on the right-hand side from the lobby of the LBH.

Tutorials will be held every second week. Next tutorial on November 24th/25th. Prepare the exercises below.

Lecturing started Tuesday October 20th at 16:15 at LBH, Hörsaal III.03, with an introductory talk
but it is still possible to join the course.

References in the manuscript are still missing but will be updated.

Important Dates

Oral Exams February 16th or March 1st LBH, Room E01 Appointments by secretary Langetepe, NN
Leture Tuesday 16:15 to 17:45 LBH, Hörsaal III.03 Start: Oct. 20th 2015 Langetepe
Tutorials Wednesday 14-16 and Thursday 10-12 LBH E08 Start: Oct. 28th 2015 Langetepe

Introduction

In this course we consider intruder and evader problems from an algorithmic point of view. We discuss problems in the context of motion planning in discrete and continuous environment. Discrete environments will be mainly defined by graphs whereras in the continuous case we will make use of the Euclidean plane or subsets of the Euclidean plane. The lecture starts with some examples examplifying the aim of the course and the bunch of methods that will be applied. The subjects are taken from different current research articles. There will be a manuscript as a main source for the course. In the tutorials or exercise groups we will discuss given problems that have to be solved and prepared by the participants of the course.

Manuscript

October 20th: Introduction
October 27th: Graphs and Trees, Static Strategies
November 3rd: Trees and dynamic strategies
November 10th: Contiguous strategies
November 17th: Cop and Robber Game
November 24th and December 1st: Randomized variants
December 1st: Prize of Connectivity
December 8th: Geometric Firefighting
December 15th: Geometric Firefighting in the plane
December 22nd: The FollowFire Curve
January 12th and 18th: Recursions and analysis of the FollowFire Curve
January 18th and 26th: Escape Path for the Intruder
January 26th: General strategies and the overall speed limit
February 2nd: Reasonable escape path in polygons

Current Full Manuscript

February 2nd: Current Full Script (will be updated)

Tutorials and Exercises

1. Tutorials October 28th/29th: Prepare Exercise 1-3 of the manuscript
2. Tutorials November 10th/11th: Prepare Exercise 6, Exercise 8 and Exercise 10 of the manuscript
3. Tutorials November 24th/25th: Prepare Exercise 11, Exercise 12, Exercise 13 and Exercise 14 of the manuscript
4. Tutorials December 9th/10th: Prepare Exercise 15, Exercise 16, Exercise 18 and Exercise 19 of the manuscript
5. Tutorials January 13th/14th: Prepare Exercise 21, Exercise 22, Exercise 23, Exercise 24 and Exercise 25 of the manuscript
6. Tutorials January 27th/28th: Prepare Exercise 27, Exercise 28, Exercise 29, Exercise 30 and Exercise 31 of the manuscript

Foils

Introduction: October 20th
Graphs and Trees, Static Strategies: October 27th
Dynamic strategies on Trees: November 3rd
Dynamic strategies on Trees: November 10th
Cop and Robber Game: November 17th
Cop and Robber cont./Randomized Variants: November 24th
Surviving rate: December 1st
Prize of Connectivity /Geometric Firefighting: December 8th
Geometric Firefighting in the plane: December 15th
The FollowFire Curve (Videos inside!): December 22th
Analysis of the FollowFire Curve : January 12th and 18th
Escape Paths for the Intruder: January 18th
Escape Paths for the Intruder Cont.: January 26th
General Lower Bound for Geometric Firefighting: January 26th
Reasonable escape path in polygons: February 2nd
Example Questions: February 9th