3.7.2018: We are successful to plot all the output (cost and time) for the domains with SDAC and ignoring SDAC (this was our task1).
We disscuss to find out more optimal path while ignoring SDAC (task 2). We want to find more optimal path to show that ignoring SDAC make larger error is not just accidental.
10.7.2018: We decided to suffle the op_i (where op_i < g_operators.size()) to get more optimal path.
Robert propose new task (task 3) to compare SDAC (into account both in search and heuristic) with SDAC (ignore heuristic).
This comaprison will helps us to show SADC dont expand nodes what diverse action costs do.
3.8.2018: We decided to continue writing. We want to write introduction,related work,evaluation (Analysis on SYMPLE). Our next meeting is on 17.8.2018. David gave me
Fast-downward. I have to run Fast-downward using trans-sas folder tasks in each domain.