Checking date: 13/05/2013

Course: 2013/2014

Automated Planning
Study: Master in Computer Science and Technology (71)

Coordinating teacher: BORRAJO MILLAN, DANIEL

Department assigned to the subject: Department of Computer Science and Engineering

Type: Electives
ECTS Credits: 3.0 ECTS


Requirements (Subjects that are assumed to be known)
- To analyze state-of-the-art automated planning techniques - To characterize every technique as well as the domains they suit better - To use tools that implement most techniques discussed in class - To identify different open issues for the research in the area and to promote the realization and completion of new PhDs
Description of contents: programme
Introduction Introduction to planning Knowledge representation Heuristic Search Classic planning Situation calculus and means-ends analysis. GPS State space. STRIPS and Prodigy Partial plans. UCPOP Neoclassic planning Plan graphs. GRAPHPLAN SAT planning. SATPLAN Heuristics Heuristic planning. HSP y FF Control knowledge Hierarchical Task Networks (HTN). SHOP2 Machine learning Other planning paradigms Time and resources (scheduling) Uncertainty
Learning activities and methodology
Theory classes One homework per week Final work project Oral presentation of project
Assessment System
  • % end-of-term-examination 50
  • % of continuous assessment (assigments, laboratory, practicals...) 50
Basic Bibliography
  • James F. Allen, James Hendler y Austin Tate (eds.). Readings in planning. Morgan Kaufmann, 1990..
  • Malik Ghallab, Dana Nau, Paolo Traverso. Automated Task Planning. Theory & Practice. Morgan Kaufmann, 2004.
  • Stuart Russell y Peter Norvig. Artificial Intelligence: A modern approach. Prentice Hall. 2010

The course syllabus and the academic weekly planning may change due academic events or other reasons.