TY - JOUR
T1 - A TIL-relaxed heuristic for planning with time windows
AU - Allard, Tony
AU - Gretton, Charles
AU - Haslum, Patrik
N1 - Publisher Copyright:
Copyright © 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2018
Y1 - 2018
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85055008280&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85055008280
SN - 2334-0835
VL - 2018-June
SP - 2
EP - 10
JO - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
JF - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
T2 - 28th International Conference on Automated Planning and Scheduling, ICAPS 2018
Y2 - 24 June 2018 through 29 June 2018
ER -