================================================================ reLOC 0.08-osaka : Multirobot Solution solver (C) Copyright 2011-2013 Pavel Surynek ---------------------------------------------------------------- Reading graph... Reading initial arrangement... Reading goal arrangement... Solving layer: 2 Solving layer: 3 Solving layer: 4 Solving layer: 5 Solving layer: 6 Solving layer: 7 Solving layer: 8 Computed optimal makespan:7 Makespan optimal solution: Mulirobot solution: (|moves| = 20, paralellism = 2.857) [ Step 0: 3#9->8 2#13->18 1#37->30 Step 1: 3#8->7 2#18->21 1#30->23 Step 2: 3#7->6 2#21->22 1#23->19 Step 3: 3#6->13 2#22->23 Step 4: 3#13->18 1#19->15 2#23->24 Step 5: 1#15->8 3#18->21 2#24->25 Step 6: 1#8->2 3#21->22 2#25->20 ] Multirobot solution analysis: ( total makespan = 7 total distance = 13 total trajectory = 20 average parallelism = 2.857 average distance = 4.333 average trajectory = 6.667 parallelism distribution = [ 0 1 6 ] distance distribution = [ 0 0 0 0 0 1 1 ] trajectory distribution = [ 0 0 0 0 0 1 2 ] ) Phase statistics (current phase = 'SAT') [ Phase (name = 'root_phase') [ Total SAT solver calls = 0 Satisfiable SAT solver calls = 0 Unsatisfiable SAT solver calls = 0 Indeterminate SAT solver calls = 0 Move executions = 0 Produced CNF variables = 0 Produced CNF clauses = 0 Search steps = 0 Wall clock TIME (seconds) = 17.677 CPU/machine TIME (seconds) = 17.680 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 7 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 6 Indeterminate SAT solver calls = 0 Move executions = 40 Produced CNF variables = 15281 Produced CNF clauses = 67954 Search steps = 0 Wall clock TIME (seconds) = 0.289 CPU/machine TIME (seconds) = 0.380 ] } ] ----------------------------------------------------------------