A Temporal Relaxed Planning Graph Heuristic for Planning With Envelopes

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

7 Citations (Scopus)
116 Downloads (Pure)

Abstract

When planning in temporal domains with required concurrency, envelopes arise where one or more actions need to occur within the execution of another. Starting an envelope action gives rise to an implicit relative deadline: all of the actions that need to occur within the envelope must complete before it ends. Finding effective heuristic guidance in these domains is challenging: the heuristic must not only consider how to reach the goals, but identify when it is not possible to achieve these implicit deadlines to avoid fruitless search. In this paper, we present an adaptation of a Temporal Relaxed Planning Graph heuristic, that accounts for dependencies between facts and actions in the relaxed planning graph; and the envelopes that are open in the state being evaluated. Results show that our new heuristic significantly improves the performance of a temporal planner on benchmark domains with required concurrency.
Original languageEnglish
Title of host publicationProceedings of the 27th International Conference on Automated Planning and Scheduling, ICAPS 2017
PublisherAAAI Press
Pages47-55
Number of pages9
ISBN (Electronic)9781577357896
Publication statusPublished - 18 Jun 2017
Event27th International Conference on Automated Planning and Scheduling, ICAPS 2017 - Pittsburgh, United States
Duration: 18 Jun 201723 Jun 2017

Publication series

NameProceedings International Conference on Automated Planning and Scheduling, ICAPS
ISSN (Electronic)2334-0835

Conference

Conference27th International Conference on Automated Planning and Scheduling, ICAPS 2017
Country/TerritoryUnited States
CityPittsburgh
Period18/06/201723/06/2017

Fingerprint

Dive into the research topics of 'A Temporal Relaxed Planning Graph Heuristic for Planning With Envelopes'. Together they form a unique fingerprint.

Cite this