================================================================ 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 Computed optimal makespan:6 Makespan optimal solution: Mulirobot solution: (|moves| = 19, paralellism = 3.167) [ Step 0: 3#6->7 4#10->5 2#13->8 1#14->15 Step 1: 3#7->12 2#8->4 1#15->10 Step 2: 2#4->3 1#10->9 3#12->13 Step 3: 2#3->2 4#5->10 3#13->12 Step 4: 2#2->1 4#10->15 3#12->7 Step 5: 2#1->0 3#7->6 1#9->10 ] Multirobot solution analysis: ( total makespan = 6 total distance = 8 total trajectory = 19 average parallelism = 3.167 average distance = 2.000 average trajectory = 4.750 parallelism distribution = [ 0 0 5 1 ] distance distribution = [ 1 0 1 0 0 0 1 ] trajectory distribution = [ 0 0 1 1 0 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) = 0.709 CPU/machine TIME (seconds) = 0.710 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 6 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 5 Indeterminate SAT solver calls = 0 Move executions = 38 Produced CNF variables = 5898 Produced CNF clauses = 31241 Search steps = 0 Wall clock TIME (seconds) = 0.121 CPU/machine TIME (seconds) = 0.180 ] } ] ----------------------------------------------------------------