Giter Site home page Giter Site logo

mastersthesis-experimental-data's Introduction

mastersthesis-experimental-data

This repository serves as a documentation for the experiments described in the Master's Thesis "Pruning Techniques for Lifted SAT-Based Hierarchical Planning" (https://github.com/NikolaiLMS/lilotane).

Used Software

The softwares we evaluated are located here:

Additionally we used the following software to help with test execution:

Execution of Planners

Content

  • instances/ contains our training and test data, which consists of the total-order instances of the IPC 2020 (https://github.com/panda-planner-dev/ipc2020-domains/tree/master/total-order)

  • evaluations/ contains the experimental data for the Parameter Evaluation, the Per Domain Evaluation and State of The Art Evaluation sections of the thesis, consisting of the logs for each instance, aswell as additional files that contain already computed metrics like IPC-Score, PAR2-Score, Coverage etc.

  • figures/ contains our created plots using the evaluation data

  • util/ contains multiple scripts we created to aid our experiments

mastersthesis-experimental-data's People

Contributors

nikolailms avatar

Watchers

 avatar

mastersthesis-experimental-data's Issues

HyperTensioN configuration

Hello, I am the author of HyperTensioN, the planner you compared against.
I found odd that no Entertainment instances were solved in your tests, as I remember fixing a parsing bug after the IPC that made the first 5 instances easily solvable (less than a second) in an old machine, repeated the tests today and they remain solvable.

Upon inspection I noticed that you are using a newer version (based on the hash in the folder name) but not the same configuration used during the IPC.
The commands from runwatch_commands.txt lack the preprocessing stages triggered by parameters provided to Hype.
HyperTensioN was deployed in the IPC with ruby Hype.rb <domain.hddl> <problem.hddl> typredicate pullup dejavu run, and it appears you applied just run, which is the same as unoptimized.
You can see more about it here.

This is probably the main reason for your comment in 4.5.1: the difference for the named planners performance should still be noted and possibly investigated in future work.

I also find it odd that you have rigid/fluent precondition preprocessing stages to prune possible paths and never compared to HyperTensioN's Pullup approach.
Elements from Fact analysis are far too similar to Pullup from my perspective.

Also, Lavindra's name is all caps in your Thesis bibliography [16].

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.