================================================================ 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| = 34, paralellism = 3.400) [ Step 0: 2#4->3 3#0->1 4#25->26 Step 1: 2#3->8 3#1->2 Step 2: 2#8->14 3#2->7 4#26->27 Step 3: 1#24->25 2#14->13 3#7->8 4#27->21 Step 4: 1#25->24 2#13->12 3#8->9 4#21->27 Step 5: 1#24->20 2#12->13 3#9->10 4#27->21 Step 6: 1#20->17 3#10->16 4#21->27 Step 7: 1#17->12 2#13->14 3#16->19 4#27->26 Step 8: 1#12->6 2#14->8 3#19->22 Step 9: 1#6->1 2#8->9 3#22->28 4#26->25 ] Multirobot solution analysis: ( total makespan = 10 total distance = 16 total trajectory = 34 average parallelism = 3.400 average distance = 4.000 average trajectory = 8.500 parallelism distribution = [ 0 1 4 5 ] distance distribution = [ 1 0 0 0 1 0 0 0 0 1 ] trajectory distribution = [ 0 0 0 0 0 0 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.979 CPU/machine TIME (seconds) = 3.980 ] 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 = 34 Produced CNF variables = 14051 Produced CNF clauses = 10947 Search steps = 0 Wall clock TIME (seconds) = 0.320 CPU/machine TIME (seconds) = 0.450 ] } ] ----------------------------------------------------------------