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.
@InProceedings{francisgreen_et_al:LIPIcs.CP.2024.12, author = {Francis Green, Adam and Beck, J. Christopher and Coles, Amanda}, title = {{Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning}}, booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-336-2}, ISSN = {1868-8969}, year = {2024}, volume = {307}, editor = {Shaw, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.12}, URN = {urn:nbn:de:0030-drops-206974}, doi = {10.4230/LIPIcs.CP.2024.12}, annote = {Keywords: AI Planning, Temporal-Numeric Planning, Constraint Programming, Scheduling} }
Feedback for Dagstuhl Publishing