================================================================ 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 Computed optimal makespan:8 Makespan optimal solution: Mulirobot solution: (|moves| = 30, paralellism = 3.750) [ Step 0: 4#0->1 3#4->9 2#24->20 1#26->27 Step 1: 4#1->6 3#9->4 2#20->17 5#25->24 Step 2: 3#4->3 4#6->1 2#17->12 5#24->23 1#27->26 Step 3: 4#1->0 3#3->2 2#12->13 1#26->25 Step 4: 3#2->1 2#13->14 1#25->24 Step 5: 3#1->2 2#14->15 1#24->20 Step 6: 4#0->5 2#15->9 1#20->17 5#23->24 Step 7: 2#9->4 1#17->12 5#24->25 ] Multirobot solution analysis: ( total makespan = 8 total distance = 16 total trajectory = 30 average parallelism = 3.750 average distance = 3.200 average trajectory = 6.000 parallelism distribution = [ 0 0 3 4 1 ] distance distribution = [ 1 1 0 0 1 0 0 1 ] trajectory distribution = [ 0 0 0 1 1 1 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) = 3.925 CPU/machine TIME (seconds) = 3.920 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 8 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 7 Indeterminate SAT solver calls = 0 Move executions = 60 Produced CNF variables = 14624 Produced CNF clauses = 77879 Search steps = 0 Wall clock TIME (seconds) = 0.336 CPU/machine TIME (seconds) = 0.430 ] } ] ----------------------------------------------------------------