Paper Info
Title
A TIL-Relaxed Heuristic for Planning with Time Windows.
Abstract
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.
Year
Venue
Field
2018
Proceedings of the International Conference on Automated Planning and Scheduling
Mathematical optimization,Heuristic,Computer science,Artificial intelligence
DocType
ISSN
Citations 
Conference
2334-0835
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Tony Allard110.68
Charles Gretton222413.79
Patrik Haslum382749.56