================================================================ 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: 1#16->11 4#13->12 5#6->7 6#10->5 Step 1: 1#11->6 2#15->10 5#7->8 6#5->1 Step 2: 1#6->7 2#10->5 3#14->15 4#12->11 5#8->13 Step 3: 1#7->8 2#5->6 3#15->10 4#11->16 6#1->2 Step 4: 2#6->7 3#10->5 4#16->11 5#13->17 6#2->3 Step 5: 1#8->13 3#5->6 4#11->12 6#3->2 ] Multirobot solution analysis: ( total makespan = 6 total distance = 16 total trajectory = 27 average parallelism = 4.500 average distance = 2.667 average trajectory = 4.500 parallelism distribution = [ 0 0 0 3 3 ] distance distribution = [ 1 0 1 3 ] trajectory distribution = [ 0 0 0 3 3 ] ) 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.707 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 = 27 Produced CNF variables = 10849 Produced CNF clauses = 6631 Search steps = 0 Wall clock TIME (seconds) = 0.218 CPU/machine TIME (seconds) = 0.250 ] } ] ----------------------------------------------------------------