Artificial Intelligence - Special issue on knowledge representation
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Backtracking algorithms for disjunctions of temporal constraints
Artificial Intelligence
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Gaining efficiency and flexibility in the simple temporal problem
TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
Incremental Algorithms for Managing Temporal Constraints
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Constraint-Based Local Search
Improved Dynamic Reachability Algorithms for Directed Graphs
SIAM Journal on Computing
Time-Dependent Scheduling
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
Simple Temporal Networks (STN) allow conjunctions of minimum and maximum distance constraints between pairs of temporal positions to be represented. This paper introduces an extension of STN called Time-dependent STN (TSTN), which covers temporal constraints for which the minimum and maximum distances required between two temporal positions x and y are not necessarily constant but may depend on the assignments of x and y. Such constraints are useful to model problems in which the transition time required between two activities may depend on the time at which the transition is triggered. Properties of the new framework are analyzed, and standard STN solving techniques are extended to TSTN. The contributions are applied to the management of temporal constraints for so-called "agile" satellites.