================================================================ 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: 1#37->30 2#13->18 3#9->8 Step 1: 1#30->23 2#18->21 3#8->7 Step 2: 1#23->19 2#21->22 3#7->6 Step 3: 2#22->23 3#6->13 Step 4: 1#19->15 2#23->24 3#13->18 Step 5: 1#15->8 2#24->25 3#18->21 Step 6: 1#8->2 2#25->20 3#21->22 ] 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.150 CPU/machine TIME (seconds) = 17.150 ] 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 = 20 Produced CNF variables = 3752 Produced CNF clauses = 6176 Search steps = 0 Wall clock TIME (seconds) = 0.122 CPU/machine TIME (seconds) = 0.230 ] } ] ----------------------------------------------------------------