@article{Hunsberger_Posenato_2021, title={Propagating Piecewise-Linear Weights in Temporal Networks}, volume={29}, url={https://ojs.aaai.org/index.php/ICAPS/article/view/3480}, DOI={10.1609/icaps.v29i1.3480}, abstractNote={<p>This paper presents a novel technique using piecewise-linear functions (PLFs) as weights on edges in the graphs of two kinds of temporal networks to solve several previously open problems. Generalizing constraint-propagation rules to accommodate PLF weights requires implementing a small handful of functions. Most problems are solved by inserting one or more edges with an initial weight of <em>δ</em> (a variable), then using the modified rules to propagate the PLF weights. For one kind of network, a new set of propagation rules is introduced to avoid a non-termination issue that arises when propagating PLF weights. The paper also presents two new results for determining the tightest horizon that can be imposed while preserving a network’s dynamic consistency/controllability.</p>}, number={1}, journal={Proceedings of the International Conference on Automated Planning and Scheduling}, author={Hunsberger, Luke and Posenato, Roberto}, year={2021}, month={May}, pages={223-231} }