TY - JOUR AU - Allard, Tony AU - Gretton, Charles AU - Haslum, Patrik PY - 2018/06/15 Y2 - 2024/03/29 TI - A TIL-Relaxed Heuristic for Planning with Time Windows JF - Proceedings of the International Conference on Automated Planning and Scheduling JA - ICAPS VL - 28 IS - 1 SE - Main Track DO - 10.1609/icaps.v28i1.13884 UR - https://ojs.aaai.org/index.php/ICAPS/article/view/13884 SP - 2-10 AB - <p> We consider planning problems with time windows, in which the availability of discrete resources is time constrained. We develop a novel heuristic that addresses specifically the difficulty of coordinating actions within time windows. The heuristic is based on solving a temporally relaxed problem and measuring the magnitude by which the relaxed solution violates the time window constraints. Applied in a state-space search planner, the heuristic reduces the number of dead-ends encountered during search, and improves planner coverage. </p> ER -