Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning

Adam Green, J. Christopher Beck, Amanda Coles

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

53 Downloads (Pure)

Abstract

We present a novel scheduling model that leverages Constraint Programming (CP) to enhance problem solving performance in Temporal Planning. Building on the established strategy of decomposing causal and temporal reasoning, our approach abstracts two common fact structures present in many Temporal Planning problems – Semaphores and Envelopes – and performs temporal reasoning in a CP-based scheduler. At each search node in a heuristic search for a temporal plan, we construct and solve a Constraint Satisfaction Problem (CSP) and integrate feedback from the CP-based scheduler to guide the causal planning search towards a solution. Through experimental analysis, we validate the impact of these advances, demonstrating a significant reduction in both the number of states searched and in search time alongside an increase in problem-solving coverage.
Original languageEnglish
Title of host publicationProceedings of the Thirtieth Conference on Principles and Practice of Constraint Programming CP 2024
Place of PublicationLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Publication statusPublished - 2 Sept 2024

Fingerprint

Dive into the research topics of 'Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning'. Together they form a unique fingerprint.

Cite this