hidden - assigned and confirmed by the Study Dept.
Date of registration:
25.10.2007
Date of assignment:
25.10.2007
Date and time of defence:
21.09.2009 00:00
Date of electronic submission:
21.09.2009
Date of proceeded defence:
21.09.2009
Opponents:
doc. RNDr. Lukáš Chrpa, Ph.D.
Guidelines
Student will familiarize himself with existing AI planning systems working with time and numerical resource constraints. Based on these studies he will propose and implement (in prototype) his own planning system. In particular, the focus of thesis is on planning with durative actions that require limited resources for their execution.
References
Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice, Morgan Kaufmann, 2004
Philippe Baptiste, Claude Le Pape, Wim Nuijten: Constraint-Based Scheduling, Kluwer, 2001
Proceedings of ICAPS and AAAI conferences
Preliminary scope of work
AI planning deals with finding a sequence of actions to achieve some goal. Traditional planning assumes instant actions with logical preconditions and effects, while real-world problems frequently require durative actions with numerical preconditions and effects (such as energy consumption and production). This work covers this second type of problems where time and numerical resources play an important role. Namely, the durative actions are assumed that can overlap in time and the actions require for their processing some possibly numerical resources with limited availability.
- assigned and confirmed by the Study Dept.