Module 02562 (2012)

Module Description - Planning

The Module Description is a strict subset of the Syllabus Page, which gives more information

Module TitlePlanning
SchoolComputer Science
Module Code06-02562
DescriptorCOMP/06-02562/LH
Member of StaffRichard Dearden
LevelH
Credits10
Semester2
Pre-requisites06-23069 (Introduction to AI) (or equivalent)
Co-requisitesNone
RestrictionsMay not be taken by anyone who has taken or is taking 06-20234 (Planning (Extended)).
Contact hours24
Delivery2 hrs/week lectures, discussion classes
Description The basic notions and problems of planning are presented, including plan-space and state-space planners, the frame problem, and hierarchical task networks. The module looks at a range of different planning problems, and a number of algorithms for solving them. These include STRIPS, UCPop, Graph Plan, SAT Plan, and HTN planners. In addition, some recent advances in planning will be looked at. These may include decision-theoretic planning, robotic architectures for planning, scheduling, and planning under uncertainty. The advantages and disadvantages of the different approaches are discussed.
Outcomes
On successful completion of this module, the student should be able to:Assessed by:
explain the main approaches to planning, both 'classical' and recent developments Examination
understand and discuss the advantages and limitations of these approaches Examination
demonstrate understanding of current techniques in the field of planning Examination
AssessmentSessional: 1.5 hr examination only.
Supplementary (where allowed): By examination only.
TextsGhallab M, Nau D & Traverso P, Automated Planning: Theory and Practice, 2004
Russell S & Norvig P, Artificial Intelligence: A Modern Approach (Second Edition), 2003
Nilsson NJ, Artificial Intelligence: A New Synthesis, 1998