Reproducing the concept of ordered landmarks in planning

The effect of ordered landmarks on plan length in forward search

Bachelor thesis (2024)

Authors

P.B. Tervoort Electrical Engineering, Mathematics and Computer Science

Contributors

I.K. Hanou Algorithmics - EEMCS (mentor)
S. Dumančić Algorithmics - EEMCS (mentor)
Luis Cruz Software Engineering - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2024 Paul Tervoort
More Info
expand_more

Published Date

01-02-2024

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

A lot of research has been conducted to make the task of plan generation more efficient. One idea to do so is the use of landmarks, which are sub-goals that must be true in every solution to the problem. The approximation of landmarks has a lower complexity than solving the task itself, and they can be used to guide the planner in the right direction.
In previous work, ideas to order landmarks are proposed and compared to algorithms that do not use them. We verify if this comparison is fair by testing both algorithms implemented in the same language and framework. In our experiment not many problem instances finish in time, but those that do are in line with previous experiments in that on average planners using landmarks produce longer solutions than planners that do not use them.