================================================================ 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 Computed optimal makespan:9 Makespan optimal solution: Mulirobot solution: (|moves| = 32, paralellism = 3.556) [ Step 0: 1#33->34 2#40->32 3#5->13 Step 1: 1#34->35 2#32->24 3#13->12 4#2->3 Step 2: 1#35->36 2#24->23 3#12->11 Step 3: 1#36->37 3#11->10 4#3->4 Step 4: 1#37->38 2#23->31 3#10->9 4#4->11 Step 5: 1#38->39 2#31->23 3#9->8 4#11->12 Step 6: 1#39->44 2#23->22 3#8->7 4#12->13 Step 7: 2#22->18 3#7->15 4#13->14 Step 8: 1#44->39 2#18->12 3#15->7 4#14->19 ] Multirobot solution analysis: ( total makespan = 9 total distance = 19 total trajectory = 32 average parallelism = 3.556 average distance = 4.750 average trajectory = 8.000 parallelism distribution = [ 0 0 4 5 ] distance distribution = [ 0 0 0 0 0 2 1 ] trajectory distribution = [ 0 0 0 0 0 0 1 2 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) = 42.392 CPU/machine TIME (seconds) = 42.390 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 9 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 8 Indeterminate SAT solver calls = 0 Move executions = 32 Produced CNF variables = 11604 Produced CNF clauses = 13901 Search steps = 0 Wall clock TIME (seconds) = 0.373 CPU/machine TIME (seconds) = 0.480 ] } ] ----------------------------------------------------------------