Planning and Scheduling (VT 2016)

Aims and Objectives

The term Planning generally refers to the problem of computing a set of actions (called a plan) that schieve given goals. This general problem typically encompasses reasoning about causal relations (the preconditions and effects of performing actions), temporal relations (e.g., among actions), and resources (whose limited availability may require action sequencing). In the context of building intelligent systems, we are often interested in computing plans that are executed by robots, and these plans often include actions for moving - hence another important problem in Planning is the specific issue of reasoning about robot motion.

The Planning and Scheduling course provides an introduction to state of the art techniques for performing all these forms of reaosning. These pertain to the active fields of research in classical planning, constraint-based scheduling, and motion planning for non-holonomic platforms. The course also provides some insight into the difficult problem of integrating these methods and employing them in the context of robot applications.

The course aims to provide students with the following key capabilities:

The course is organized in seven parts.

Lecture material

Links to lecture slides will appear here as they are given in class.

* outside the scope of this course

Course Books

Additional References (Classical Planning)

Additional References (Planning under Uncertainty)

Additional References (Scheduling and Coordinated Motion)

Additional References (Motion Planning)

Lab material