================================================================ 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| = 35, paralellism = 5.000) [ Step 0: 1#0->1 6#6->7 7#10->11 5#13->8 4#14->9 Step 1: 1#1->2 5#8->4 7#11->12 3#15->10 Step 2: 1#2->6 5#4->3 4#9->14 3#10->5 7#12->13 2#16->15 Step 3: 5#3->2 3#5->1 1#6->11 6#7->12 7#13->8 2#15->18 Step 4: 3#1->0 5#2->6 7#8->4 6#12->7 4#14->15 Step 5: 7#4->3 5#6->5 1#11->10 4#15->16 Step 6: 3#0->1 7#3->2 6#7->6 1#10->9 2#18->15 ] Multirobot solution analysis: ( total makespan = 7 total distance = 14 total trajectory = 35 average parallelism = 5.000 average distance = 2.000 average trajectory = 5.000 parallelism distribution = [ 0 0 0 2 3 2 ] distance distribution = [ 1 1 1 1 2 ] trajectory distribution = [ 0 0 1 2 1 2 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.697 CPU/machine TIME (seconds) = 0.700 ] 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 = 70 Produced CNF variables = 7742 Produced CNF clauses = 44505 Search steps = 0 Wall clock TIME (seconds) = 0.490 CPU/machine TIME (seconds) = 0.550 ] } ] ----------------------------------------------------------------