================================================================ 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| = 22, paralellism = 3.667) [ Step 0: 1#12->13 3#10->6 4#8->9 5#0->1 Step 1: 1#13->14 2#4->0 3#6->3 4#9->10 5#1->2 Step 2: 1#14->13 2#0->1 5#2->5 Step 3: 1#13->14 3#3->2 4#10->6 5#5->9 Step 4: 1#14->10 3#2->3 4#6->5 Step 5: 1#10->6 2#1->2 5#9->8 ] Multirobot solution analysis: ( total makespan = 6 total distance = 11 total trajectory = 22 average parallelism = 3.667 average distance = 2.200 average trajectory = 4.400 parallelism distribution = [ 0 0 3 2 1 ] distance distribution = [ 0 2 1 1 ] trajectory distribution = [ 0 0 1 2 1 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.262 CPU/machine TIME (seconds) = 0.260 ] 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 = 22 Produced CNF variables = 6467 Produced CNF clauses = 3033 Search steps = 0 Wall clock TIME (seconds) = 0.117 CPU/machine TIME (seconds) = 0.180 ] } ] ----------------------------------------------------------------