================================================================ 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| = 27, paralellism = 4.500) [ Step 0: 6#0->1 3#4->7 4#10->6 2#12->11 1#13->14 Step 1: 6#1->2 4#6->3 3#7->4 5#8->9 1#14->10 Step 2: 6#2->5 3#4->0 5#9->13 1#10->6 Step 3: 3#0->1 6#5->9 1#6->10 2#11->7 5#13->12 Step 4: 3#1->2 2#7->4 6#9->13 1#10->14 5#12->8 Step 5: 2#4->0 5#8->9 6#13->12 ] Multirobot solution analysis: ( total makespan = 6 total distance = 11 total trajectory = 27 average parallelism = 4.500 average distance = 1.833 average trajectory = 4.500 parallelism distribution = [ 0 0 1 1 4 ] distance distribution = [ 2 1 1 1 ] trajectory distribution = [ 0 1 0 1 3 1 ] ) 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.250 CPU/machine TIME (seconds) = 0.250 ] 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 = 54 Produced CNF variables = 4533 Produced CNF clauses = 23630 Search steps = 0 Wall clock TIME (seconds) = 0.140 CPU/machine TIME (seconds) = 0.180 ] } ] ----------------------------------------------------------------