On Redundancy in Simple Temporal Networks

Publication Type:
Conference Proceeding
Citation:
Frontiers in Artificial Intelligence and Applications, 2016, 285 pp. 828 - 836
Issue Date:
2016
Full metadata record
Files in This Item:
Filename Description Size
submitted_version.pdfAccepted Manuscript version315.97 kB
Adobe PDF
The Simple Temporal Problem (STP) has been widely used in various applications to schedule tasks. For dynamical systems, scheduling needs to be efficient and flexible to handle uncertainty and perturbation. To this end, modern approaches usually encode the temporal information as an STP instance. This representation contains redundant information, which can not only take a significant amount of storage space, but also make scheduling inefficient due to the non-concise representation. In this paper, we investigate the problem of simplifying an STP instance by removing redundant information. We show that such a simplification can result in a unique minimal representation without loss of temporal information, and present an efficient algorithm to achieve this task. Evaluation on a large benchmark dataset of STP exhibits a significant reduction in redundant information for the involved instances.
Please use this identifier to cite or link to this item: