================================================================ 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| = 30, paralellism = 4.286) [ Step 0: 4#4->7 1#6->3 3#12->11 2#13->9 Step 1: 7#0->4 2#9->5 5#10->6 3#11->12 Step 2: 2#5->2 4#7->11 6#8->9 Step 3: 2#2->1 5#6->5 6#9->10 3#12->13 Step 4: 2#1->0 1#3->2 7#4->7 6#10->6 3#13->9 Step 5: 2#0->4 1#2->1 6#6->3 7#7->8 3#9->10 4#11->12 Step 6: 6#3->2 2#4->7 7#8->9 4#12->13 ] Multirobot solution analysis: ( total makespan = 7 total distance = 18 total trajectory = 30 average parallelism = 4.286 average distance = 2.571 average trajectory = 4.286 parallelism distribution = [ 0 0 1 4 1 1 ] distance distribution = [ 0 1 4 1 ] trajectory distribution = [ 0 1 1 2 2 0 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.254 CPU/machine TIME (seconds) = 0.260 ] 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 = 60 Produced CNF variables = 5950 Produced CNF clauses = 33695 Search steps = 0 Wall clock TIME (seconds) = 0.353 CPU/machine TIME (seconds) = 0.380 ] } ] ----------------------------------------------------------------