A TIL-Relaxed Heuristic for Planning with Time Windows

Authors

  • Tony Allard Cyber and Electronic Warfare Division Defence Science and Technology Group
  • Charles Gretton Australian National University
  • Patrik Haslum Australian National University, CSIRO Data61

DOI:

https://doi.org/10.1609/icaps.v28i1.13884

Keywords:

Automated Planning, Temporal Planning, Time Windows, Timed Initial Literals, Heuristic Search Planning

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.

Downloads

Published

2018-06-15

How to Cite

Allard, T., Gretton, C., & Haslum, P. (2018). A TIL-Relaxed Heuristic for Planning with Time Windows. Proceedings of the International Conference on Automated Planning and Scheduling, 28(1), 2-10. https://doi.org/10.1609/icaps.v28i1.13884

Issue

Vol. 28 (2018): Twenty-Eighth International Conference on Automated Planning and Scheduling

Section

Main Track