Time-dependent Simple Temporal Networks.

Abstract : 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.
Type de document :
Communication dans un congrès
18th International Conference on Principles and Practice of Constraint Programming (CP-2012), Oct 2012, QUEBEC CITY, Canada
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal-onera.archives-ouvertes.fr/hal-01061381
Contributeur : Alain Broc <>
Soumis le : vendredi 5 septembre 2014 - 16:06:51
Dernière modification le : mercredi 28 mars 2018 - 14:16:10
Document(s) archivé(s) le : samedi 6 décembre 2014 - 11:43:57

Fichier

DCSD13011.1360575054.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01061381, version 1

Collections

Citation

C. Pralet, G. Verfaillie. Time-dependent Simple Temporal Networks.. 18th International Conference on Principles and Practice of Constraint Programming (CP-2012), Oct 2012, QUEBEC CITY, Canada. 〈hal-01061381〉

Partager

Métriques

Consultations de la notice

209

Téléchargements de fichiers

215