THE UNIVERSITY of EDINBURGH

DEGREE REGULATIONS & PROGRAMMES OF STUDY 2011/2012

University Homepage
DRPS Homepage
DRPS Search
DRPS Contact
DRPS : Course Catalogue : School of Informatics : Informatics

Postgraduate Course: Automated Planning (Level 11) (INFR11080)

Course Outline
School School of Informatics College College of Science and Engineering
Course type Standard Availability Not available to visiting students
Credit level (Normal year taken) SCQF Level 11 (Postgraduate) Credits 10
Home subject area Informatics Other subject area None
Course website http://www.inf.ed.ac.uk/teaching/courses/plan Taught in Gaelic? No
Course description The aim of this course is to provide a solid grounding in artificial intelligence techniques for planning, with a comprehensive view of the wide spectrum of different problems and approaches, including their underlying theory and their applications.
Entry Requirements
Pre-requisites Co-requisites
Prohibited Combinations Students MUST NOT also be taking Automated Planning (Level 10) (INFR10045)
Other requirements For Informatics PG and final year MInf students only, or by special permission of the School.
Additional Costs None
Course Delivery Information
Delivery period: 2011/12 Semester 1, Not available to visiting students (SS1) WebCT enabled:  No Quota:  None
Location Activity Description Weeks Monday Tuesday Wednesday Thursday Friday
No Classes have been defined for this Course
First Class First class information not currently available
Exam Information
Exam Diet Paper Name Hours:Minutes
Main Exam Diet S2 (April/May)2:00
Summary of Intended Learning Outcomes
1 - Understand and formalize different planning problems.
2 - Discuss the theoretical and practical applicability of different approaches.
3 - Have the basic know how to design and implement planning systems.
4 - Ability to review planning literature relevant to an area covered in the course.
5 - Know how to use planning technology for projects in different application domains.
Assessment Information
Written Examination 70
Assessed Assignments 30
Oral Presentations 0

Assessment
- Practical exercise with automated planning systems
- Survey of techniques used in nominated planning systems
- Literature review of a selected area
Special Arrangements
None
Additional Information
Academic description Not entered
Syllabus Core Elements
* Introduction and overview: intuitions and motivations. Basic conceptual model for planning: state transition systems, classical assumptions. Overview of different planning problems and approaches.
* Classical planning: The classical planning problem. Situation Calculus and the Frame Problem. Classical representations and languages (e.g., STRIPS-like). Overview of State-Space Planning and Plan-Space Planning.
* Hierarchical Task Network Planning. Partial-Order Planners. Mixed-initiative Planners.
* Neoclassical Planning: Modern approaches to the classical planning problem: e.g., Planning-Graph techniques, SAT-based planning.
* Heuristics and Control Strategies: Heuristics (in state-space and plan-space planning). Hand-coded control rules and control strategies. Deductive planning and control strategies in deductive planning.
* Planning with Time and Resources: Basics of point and interval temporal algebra. Temporal constraints networks. Planning with temporal operators. Integrating planning and scheduling
* More advanced planning topics: Knowledge Engineering for Planning (including advanced representations), distributed multi-agent planning, and plan execution.
* Case Studies and Applications: A selection from robotics, manufacturing, assembly, emergency response, space exploration, games, planning for the web, etc.

Areas Covered by Self-Study and Literature Review
* Scheduling: Linear and Integer Programming. Dynamic Scheduling. Applications to real world scheduling problems. Design, development and implementation of scheduling systems.
* Planning under uncertainty: different sources of uncertainty (e.g., nondeterministic actions, partial observability). Extensions to classical approaches (e.g., plan-space, planning-graph and propositional satisfiability techniques). Planning based on Markov Decision Processes. Planning based on Model Checking.
* Other problems and approaches which are open to review and study: Case-Based Planning. Plan Merging and Plan Rewriting. Abstraction Hierarchies. Domain Analysis. Typed variables and state invariants. Other kinds of domain analysis. Planning and Learning. Planning and Acting, Situated Planning, Dynamic Planning. Plan Recognition. Learning in Planning. Mixed-Initiative Planning. Knowledge-based Planning.

Relevant QAA Computing Curriculum Sections: Artificial Intelligence
Transferable skills Not entered
Reading list "Automated Planning: Theory and Practice" by M. Ghallab, D. Nau, and P. Traverso (Elsevier, ISBN 1-55860-856-7) 2004.
Study Abroad Not entered
Study Pattern Lectures 20
Tutorials 0
Timetabled Laboratories 0
Non-timetabled assessed assignments 30
Private Study/Other 50
Total 100
Keywords Not entered
Contacts
Course organiser Dr Michael Rovatsos
Tel: (0131 6)51 3263
Email: mrovatso@inf.ed.ac.uk
Course secretary Miss Kate Weston
Tel: (0131 6)50 2701
Email: Kate.Weston@ed.ac.uk
Navigation
Help & Information
Home
Introduction
Glossary
Search DPTs and Courses
Regulations
Regulations
Degree Programmes
Introduction
Browse DPTs
Courses
Introduction
Humanities and Social Science
Science and Engineering
Medicine and Veterinary Medicine
Other Information
Timetab
Prospectuses
Important Information
 
copyright 2011 The University of Edinburgh - 3 April 2011 11:21 am