remove flip

Author: guilyx

README.md

@@ -69,7 +69,7 @@ You should have a `pddl-examples` folder containing PDDL instances.
 
 ```python
 from jupyddl import AutomatedPlanner # takes some time because it has to instantiate the Julia interface
-apl = AutomatedPlanner("pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl)
+apl = AutomatedPlanner("pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl)
 
 apl.initial_state
 <PyCall.jlwrap PDDL.State(Set(Julog.Term[row(r1), column(c3), row(r3), row(r2), column(c2), column(c1)]), Set(Julog.Term[white(r2, c1), white(r1, c2), white(r3, c2), white(r2, c3)]), Dict{Symbol,Any}())>
@@ -102,7 +102,7 @@ from jupyddl import DataAnalyst
 da = DataAnalyst()
 da.plot_astar() # plots complexity statistics for all the problem.pddl/domain.pddl couples in the pddl-examples/ folder
 
-da.plot_astar(problem="pddl-examples/flip/problem.pddl", domain="pddl-examples/flip/domain.pddl") # scatter complexity statistics for the provided pddl
+da.plot_astar(problem="pddl-examples/dinner/problem.pddl", domain="pddl-examples/dinner/domain.pddl") # scatter complexity statistics for the provided pddl
 
 da.plot_astar(heuristic_key="basic/zero") # use h=0 instead of goal_count for your computation
 

jupyddl/data_analyst.py

@@ -42,7 +42,7 @@ def __get_all_pddl_from_data(self, max_pddl_instances=-1):
                         return domains_problems
             return domains_problems
         return [
-            ("pddl-examples/flip/problem.pddl", "pddl-examples/flip/domain.pddl"),
+            ("pddl-examples/dinner/problem.pddl", "pddl-examples/dinner/domain.pddl"),
             ("pddl-examples/dinner/problem.pddl", "pddl-examples/dinner/domain.pddl"),
         ]
 

tests/test_astar.py

@@ -10,23 +10,23 @@
 
 def test_astar_basic():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     heuristic = BasicHeuristic(apla, "basic/goal_count")
     astar = AStarBestFirstSearch(apla, heuristic.compute)
     assert astar.init.h_cost == heuristic.compute(apla.initial_state)
 
 def test_astar_delete_relaxation():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     heuristic = DeleteRelaxationHeuristic(apla, "delete_relaxation/h_max")
     astar = AStarBestFirstSearch(apla, heuristic.compute)
     assert astar.init.h_cost == heuristic.compute(apla.initial_state)
 
 def test_astar_goal():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     heuristic = BasicHeuristic(apla, "basic/goal_count")
     astar = AStarBestFirstSearch(apla, heuristic.compute)
@@ -36,7 +36,7 @@ def test_astar_goal():
 
 def test_astar_path_length():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     path, _, _ = apla.astar_best_first_search()
     assert len(path) > 0

tests/test_automated_planner.py

@@ -9,22 +9,22 @@
 
 def test_parsing():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     assert str(apla.problem) != "" and str(apla.domain) != ""
 
 
 def test_available_actions():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     actions = apla.available_actions(apla.initial_state)
     assert len(actions) > 0
 
 
 def test_execute_action():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     actions = apla.available_actions(apla.initial_state)
     new_state = apla.transition(apla.initial_state, actions[0])
@@ -33,14 +33,14 @@ def test_execute_action():
 
 def test_state_has_term():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     is_goal = apla.state_has_term(apla.initial_state, apla.goals[0])
     assert not is_goal
 
 
 def test_state_assertion():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     assert not apla.satisfies(apla.problem.goal, apla.initial_state)

tests/test_data_analyst.py

@@ -20,43 +20,43 @@ def test_heuristics_comparer():
 def test_heuristics_comparer_single():
     da = DataAnalyst()
     da.comparative_astar_heuristic_plot(
-        domain="pddl-examples/flip/domain.pddl",
-        problem="pddl-examples/flip/problem.pddl",
+        domain="pddl-examples/dinner/domain.pddl",
+        problem="pddl-examples/dinner/problem.pddl",
     )
 
 
 def test_data_analyst_plot_dfs_one_pddl():
     da = DataAnalyst()
     da.plot_dfs(
-        domain="pddl-examples/flip/domain.pddl",
-        problem="pddl-examples/flip/problem.pddl",
+        domain="pddl-examples/dinner/domain.pddl",
+        problem="pddl-examples/dinner/problem.pddl",
     )
     assert True
 
 
 def test_data_analyst_plot_bfs_one_pddl():
     da = DataAnalyst()
     da.plot_bfs(
-        domain="pddl-examples/flip/domain.pddl",
-        problem="pddl-examples/flip/problem.pddl",
+        domain="pddl-examples/dinner/domain.pddl",
+        problem="pddl-examples/dinner/problem.pddl",
     )
     assert True
 
 
 def test_data_analyst_plot_dijkstra_one_pddl():
     da = DataAnalyst()
     da.plot_dijkstra(
-        domain="pddl-examples/flip/domain.pddl",
-        problem="pddl-examples/flip/problem.pddl",
+        domain="pddl-examples/dinner/domain.pddl",
+        problem="pddl-examples/dinner/problem.pddl",
     )
     assert True
 
 
 def test_data_analyst_plot_astar_h_goal_count_one_pddl():
     da = DataAnalyst()
     da.plot_astar(
-        domain="pddl-examples/flip/domain.pddl",
-        problem="pddl-examples/flip/problem.pddl",
+        domain="pddl-examples/dinner/domain.pddl",
+        problem="pddl-examples/dinner/problem.pddl",
     )
     assert True
 
@@ -150,17 +150,17 @@ def test_comparative_one_pddl():
     da.comparative_data_plot(
         dfs=False,
         bfs=False,
-        domain="pddl-examples/flip/domain.pddl",
-        problem="pddl-examples/flip/problem.pddl",
+        domain="pddl-examples/dinner/domain.pddl",
+        problem="pddl-examples/dinner/problem.pddl",
     )
     assert True
 
 
 def test_comparative_use_data_json():
     da = DataAnalyst()
     da.comparative_data_plot(
-        domain="pddl-examples/flip/domain.pddl",
-        problem="pddl-examples/flip/problem.pddl",
+        domain="pddl-examples/dinner/domain.pddl",
+        problem="pddl-examples/dinner/problem.pddl",
         collect_new_data=False,
     )
     assert True
@@ -169,8 +169,8 @@ def test_comparative_use_data_json():
 def test_comparative_zero_h():
     da = DataAnalyst()
     da.comparative_data_plot(
-        domain="pddl-examples/flip/domain.pddl",
-        problem="pddl-examples/flip/problem.pddl",
+        domain="pddl-examples/dinner/domain.pddl",
+        problem="pddl-examples/dinner/problem.pddl",
         heuristic_key="zero",
     )
     assert True

tests/test_heuristics.py

@@ -16,7 +16,7 @@
 
 def test_zero_heuristic():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     heuristic = hs.BasicHeuristic(apla, "basic/zero")
     h = heuristic.compute(apla.initial_state)

tests/test_search.py

@@ -20,7 +20,7 @@ def test_search_dfs():
 
 def test_search_bfs():
     apla = AutomatedPlanner(
-        "pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl"
+        "pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl"
     )
     bfs = BreadthFirstSearch(apla)
     res = bfs.search()  # Path, computation time, opened nodes