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.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal-onera.archives-ouvertes.fr/hal-01061381
Contributor : Alain Broc <>
Submitted on : Friday, September 5, 2014 - 4:06:51 PM
Last modification on : Tuesday, March 26, 2019 - 2:28:03 PM
Long-term archiving on : Saturday, December 6, 2014 - 11:43:57 AM

File

DCSD13011.1360575054.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

326

Files downloads

325