Thesis (Selection of subject)Thesis (Selection of subject)(version: 336)
Assignment details
   Login via CAS
Temporal networks
Thesis title in Czech: Temporal networks
Thesis title in English: Temporal networks
Academic year of topic announcement: 2006/2007
Type of assignment: diploma thesis
Thesis language: angličtina
Department: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Supervisor: prof. RNDr. Roman Barták, Ph.D.
Author: hidden - assigned and confirmed by the Study Dept.
Date of registration: 08.11.2006
Date of assignment: 08.11.2006
Date and time of defence: 21.09.2009 00:00
Date of electronic submission:21.09.2009
Date of proceeded defence: 21.09.2009
Reviewers: doc. RNDr. Ondřej Čepek, Ph.D.
 
 
 
Guidelines
The student will familiarise himself with using temporal networks in modelling time relations in planning and scheduling. Based on this study, he will propose an extension of temporal networks motivated by real-life problems like assuming resources constraints or alternative paths in the network.
References
1) N. Muscettola, M. Pollack: Temporal and Resource Reasoning for Planning, Scheduling and Execution, tutorial at ICAPS 2005
http://icaps05.uni-ulm.de/tutorials.html

2) M. Ghallab, D. Nau, P. Traverso: Automated Planning: Theory and Practice, Morgan Kaufmann, 2004

3) R. Barták, O.Čepek: Incremental Filtering Algorithms for Precedence and Dependency Constraints. In Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006). IEEE Press, 2006
Preliminary scope of work
Temporal networks represent one of the fundamental models of time in planning and scheduling. In real-life systems, the base temporal networks need to be extended to handle features like logical relations between nodes or assuming resource constraints. This work deals with the extended models of temporal networks motivated by real-life problems.
 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html