================================================================ 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 Solving layer: 9 Solving layer: 10 Solving layer: 11 Computed optimal makespan:10 Makespan optimal solution: Mulirobot solution: (|moves| = 28, paralellism = 2.800) [ Step 0: 3#0->1 1#24->20 4#25->26 Step 1: 3#1->2 2#4->9 1#20->17 4#26->25 Step 2: 3#2->3 4#25->24 Step 3: 3#3->8 2#9->15 1#17->20 Step 4: 3#8->14 2#15->9 1#20->17 4#24->23 Step 5: 2#9->10 3#14->15 1#17->12 Step 6: 2#10->9 1#12->6 3#15->16 4#23->24 Step 7: 3#16->19 Step 8: 3#19->22 Step 9: 1#6->1 3#22->28 4#24->25 ] Multirobot solution analysis: ( total makespan = 10 total distance = 16 total trajectory = 28 average parallelism = 2.800 average distance = 4.000 average trajectory = 7.000 parallelism distribution = [ 2 1 4 3 ] distance distribution = [ 1 0 0 0 1 0 0 0 0 1 ] trajectory distribution = [ 0 0 0 0 1 1 1 0 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) = 4.094 CPU/machine TIME (seconds) = 4.090 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 10 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 9 Indeterminate SAT solver calls = 0 Move executions = 56 Produced CNF variables = 21940 Produced CNF clauses = 119778 Search steps = 0 Wall clock TIME (seconds) = 0.484 CPU/machine TIME (seconds) = 0.620 ] } ] ----------------------------------------------------------------