Optimizing the PDDL domain of TUSP to improve planner performance

Modifying the domain to improve planner execution time, plan quality, and problem solvability

Bachelor thesis (2023)

Authors

S. Chiu Electrical Engineering, Mathematics and Computer Science

Contributors

I.K. Hanou (supervisor 1)
S. Dumančić Algorithmics - EEMCS (supervisor 2)
R. Hai Web Information Systems - EEMCS (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2023 Simba Chiu
Train Unit Shunting Problem Classical Planning Planning Domain Definition Language International Planning Competition 2018
More Info
expand_more

Published Date

28-06-2023

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

It is possible to improve the performance of planners by modifying the PDDL domain of a problem. The goal of this research is to implement this to the domain of the Train Unit Shunting Problem (TUSP). The research question we attempt to answer is: To what extent can we improve planner performance by optimizing the PDDL domain of TUSP? The main contributions of this research are: a formalization of the TUSP and its constraints in PDDL terminology, a comprehensive evaluation of the performance of planners on the PDDL domain of TUSP, provide general approaches and techniques that can be used to optimize a PDDL domain, and provide insights into the relationship between the performance of planners and PDDL domain properties. To answer the research question, we measure the performance of the planners in terms of execution time, plan quality, and problem solvability. We modified the domain by combining actions such that the number of computations is decreased and by introducing action costs. With these modifications, we found a decrease in planner execution time and an increase in plan quality. We found no difference in problem solvability. Therefore, we can conclude that we can indeed improve the performance of planners by implementing these modifications to the domain of TUSP.