Planning and game playing
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
AE4M36PAH | Z,ZK | 6 | 2P+2C | English |
- Garant předmětu:
- Lecturer:
- Tutor:
- Supervisor:
- Department of Computer Science
- Synopsis:
-
This course provides an introduction to classical AI planning (linear, nonliner planning, graph-plan planning, heuristic planning, SAT-based planning) and game-tree representation and methods of adversarial search (such as minimax and alpha/beta pruning).
- Requirements:
- Syllabus of lectures:
-
1. planning problem representation and planning problem komplexity
2. linear planning, TOPLAN algorithm,
3. nonlineární planning, causal links thread resolution
4. Graf-oriented planning
5. planning by means of SAT
6. Introduction to game playing
7. Minimax, alfa-beta prunning
8. Advenced methods of adversarial planning
9. Hierarchical HTN planning
10. Heuristic planning
11. Contingency planning, temporal planning
12. Planning a probability
13. Planning in game playing
- Syllabus of tutorials:
-
1. Planning problems
2. Semestral project specification: design and development of a general planner
3. - 5. Laboratories
6. Game playing algorithms
7. Semestral project specification: design and development of a game playing algorithm
8. - 12. Laboratories
13. Competition
- Study Objective:
- Study materials:
-
Nau, D., Ghallab, M., and Traverso, P. 2004 Automated Planning: Theory
and Practice. Morgan Kaufmann Publishers Inc.
Russell, S. J. and Norvig, P. 2003 Artificial Intelligence: a Modern
Approach. 2. Pearson Education.
- Note:
- Further information:
- https://cw.fel.cvut.cz/wiki/courses/ae4m36pah/start
- No time-table has been prepared for this course
- The course is a part of the following study plans: