Module 02562 (2006)
Syllabus page 2006/2007
06-02562
Planning
Level 3/H
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus
The Module Description is a strict subset of this Syllabus Page. (The University module description has not yet been checked against the School's.)
Relevant Links
For more information (like notes, handouts) see the module web page at
http://www.cs.bham.ac.uk/~rwd/planning_slides.html.
Outline
The basic notions and problems of planning are presented, including the frame problem. In order to achieve practical results, the general planning problem has been restricted to special cases like the 'blocks world' with complete information and one agent. For this setting, different procedures were developed; in particular the module presents the linear planning system STRIPS, non-linear planning and hierarchical planning with abstraction of the situation and of the operators. The advantages and disadvantages of the different approaches are discussed.
Aims
The aims of this module are to:
- introduce the basic concepts and terminology of planning
- give an overview of the main approaches to planning, including classical approaches as well as recent developments
- present the strengths and limitations of the different approaches
- enable students to read up-to-date research papers in planning
Learning Outcomes
| On successful completion of this module, the student should be able to: | Assessed by: | |
| 1 | explain the main approaches to planning, both 'classical' and recent developments | Examination |
| 2 | understand and discuss the advantages and limitations of these approaches | Examination |
| 3 | apply planning algorithms to previously unseen examples | Examination |
| 4 | explain the relationship between approaches to mechanised planning and human planning | Examination |
| 5 | read, understand, and give a presentation on a recent research paper in the field | Continuous Assessment |
Restrictions, Prerequisites and Corequisites
Restrictions:
May not be taken in conjunction with 06-20234 (Planning (Extended)).
Prerequisites:
06-18188 (Introduction to AI) (or equivalent)
Co-requisites:
None
Teaching
Teaching Methods:
2 hrs/week lectures, discussion classes, short presentations of original publications.
Contact Hours:
Assessment
- Sessional: 1.5 hr examination (80%), continuous assessment (20%).
- Supplementary (where allowed): By examination only with the continuous assessment mark carried forward.
Recommended Books
| Title | Author(s) | Publisher, Date |
| Automated Planning: Theory and Practice | Ghallab M, Nau D & Traverso P | 2004 |
| Artificial Intelligence: A Modern Approach (Second Edition) | Russell S & Norvig P | 2003 |
| Artificial Intelligence: A New Synthesis | Nilsson NJ | 1998 |
| An Introduction to MultiAgent Systems | Wooldridge M | 2002 |
Detailed Syllabus
-
Basic notions of planning
- Goals
- Blocks World
- Deductive planning
- Frame problem, frame axioms (tractability)
- Planning as search (breadth-first search, depth-first search, heuristic search)
- Planning with STRIPS, Representation, Search, Limits
- Interaction of partial goals
- Unsolvable problems
- Planning for simultaneous goals (solution to the so-called Sussman anomaly)
- Non-Linear Planning
- Basic idea and notions
- Classification and solution of conflicts
- Critics
- Linear vs. non-linear planning
- Hierarchical Planning
- Planning with abstraction of situations
- Planning with abstraction of operators
- Conditional Planning (sensing, dependence on unknown facts)
- Reactivity vs Deliberation
- Multi-agent planning
- Efficient methods (GraphPlan, SAT planning)
- Planning with an explicit notion of time
Last updated: 6 Feb 2006
Source file: /internal/modules/COMSCI/2006/xml/02562.xml
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus