| TDDD48 |
Automated Planning, 6 ECTS credits.
/Automatisk planering/
For:
CS
D
DAV
IT
|
| |
Prel. scheduled
hours: 64
Rec. self-study hours: 96
|
| |
Area of Education: Technology
Main field of studies: Computer Science, Computer Engineering
|
| |
Advancement level
(G1, G2, A): A
|
|
Aim:
Planning is the task of thinking before you act: Not only reacting to the environment, but using knowledge about the world to determine what to do in order to achieve a given goal. Automated planning is a central topic in AI, and task and motion planning capabilities are essential to the construction of many robust autonomous systems. Recently, research in planning has seen a great deal of excitement, with a variety of new approaches vastly outperforming older techniques in terms of speed as well as applicability and expressive power. Planning technologies are currently used with great success in applications ranging from production lines and elevators to unmanned aerial vehicles (UAVs) and space applications such as the Hubble Space Telescope and the Mars rovers. The aim of this course is to provide a comprehensive view of a wide range of planning techniques, as well as hands-on experience in constructing and modeling planning domains to solve specific planning problems.
After the course, the student will be able to:
- Evaluate and apply a variety of planning techniques for classical planning as well as for knowledge-intensive planning and planning under uncertainty.
- Explain the practical advantages and disadvantages of different levels of expressivity in planning models.
- Model classical as well as probabilistic planning problems in commonly used domain definition languages.
- Evaluate and apply common techniques for goal-directed planning, such as various forms of heuristics and control rules.
- Explain the workings of commonly used path and motion planning techniques.
|
|
Prerequisites: (valid for students admitted to programmes within which the course is offered)
Basic knowledge and understanding of data structures and algorithms
as well as logic and discrete mathematics. Knowledge and understanding of basic artificial intelligence techniques and concepts, including state-space search, heuristics and the A* search algorithm.
Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshhold requirements for progression within the programme, or corresponding.
|
|
Supplementary courses:
AI Programming
|
|
Organisation:
A series of lectures present the theory behind planning as well as many practically useful techniques for plan generation under varying assumptions about the environment. A set of laboratory exercises provide hands-on experience using several state-of-the-art planning paradigms and planning systems. In addition to developing domain models for a set of interesting planning problems, participants will explore how different heuristics and domain
knowledge can be used to improve plan quality as well as performance. Probabilistic planning will be explored through simulated execution.
|
|
Course contents:
- Introduction to planning
- The classical planning paradigm
- Algorithms for classical and neo-classical planning
- Planning with time and resource constraints
- Planning with rich domain knowledge: How to make use of all you know
- Planning under uncertainty: How to handle incomplete knowledge
- Path planning and motion planning
|
|
Course literature:
Automated Planning: Theory and Practice, Malik Ghallab, Dana Nau and Paolo Traverso, ISBN: 1-55860-856-7
|
|
Examination: |
|
Written examination
Laboratory work
|
3 ECTS
3 ECTS
|
| |
|
|
Course language is English.
Department offering the course: IDA.
Director of Studies: Peter Dalenius
Examiner: Jonas Kvarnström
Course Syllabus in Swedish
|