Extending SymbolicPlanners with forward propagation landmark extraction

Title

Extending SymbolicPlanners with forward propagation landmark extraction

 Author

Yang, Ka Fui (TU Delft Electrical Engineering, Mathematics and Computer Science)

Contributor

Hanou, I.K. (mentor)
Dumančić, S. (mentor)
Cruz, Luis (graduation committee) ORCID 0000-0002-1615-355X

 Degree granting institution

Delft University of Technology

 Programme

Computer Science and Engineering

 Project

CSE3000 Research Project

 Date

2024-02-01

 Abstract

The Fast Downward planning system is currently mainly used for solving classical problems. Another alternative to Fast Downward is SymbolicPlanners, which sacrifices speed for generality and extensibility. SymbolicPlanners is missing landmark based planners and landmark extraction algorithms. The research question we are trying to answer in this research paper is: What design choices can be made to adapt the forward propagation extraction algorithm into SymbolicPlanners?
The forward propagation landmark generation design choices are discussed and implemented in SymbolicPlanners. The runtime performance of the implementation is only about two times slower than the Fast Downward implementation. Another aspect of the implementation is the incorrect amount of landmarks generated in complex problems caused by limitation in the relaxed planning graph from SymbolicPlanners.

 Subject

Classical Planning
Propagation
Landmark

 To reference this document use:

http://resolver.tudelft.nl/uuid:8d0cdd3e-e68a-4202-a4b1-9b139d49e555

 Part of collection

Student theses

 Document type

bachelor thesis

 Rights

© 2024 Ka Fui Yang
Files
PDF Final_Paper.pdf 373.81 KB
Close viewer