================================================================ 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 Solving layer: 12 Solving layer: 13 Computed optimal makespan:12 Makespan optimal solution: Mulirobot solution: (|moves| = 99, paralellism = 8.250) [ Step 0: 11#0->5 1#2->7 10#4->3 3#17->12 4#22->19 9#24->23 8#26->27 Step 1: 5#1->0 10#3->2 11#5->6 1#7->8 2#9->4 3#12->13 4#19->16 6#20->17 12#25->26 8#27->28 Step 2: 5#0->5 10#2->1 2#4->3 1#8->14 3#13->7 4#16->15 6#17->12 7#21->27 12#26->25 8#28->22 Step 3: 2#3->2 5#5->11 3#7->8 6#12->13 1#14->18 8#22->19 12#25->24 7#27->26 Step 4: 11#6->7 3#8->3 5#11->5 6#13->14 4#15->9 8#19->16 12#24->20 7#26->27 Step 5: 10#1->0 3#3->4 5#5->11 11#7->13 4#9->8 6#14->15 8#16->10 12#20->17 Step 6: 10#0->5 2#2->3 4#8->7 8#10->9 11#13->14 6#15->16 12#17->12 7#27->26 Step 7: 10#5->6 4#7->2 8#9->8 12#12->13 11#14->15 6#16->19 7#26->25 Step 8: 4#2->1 3#4->9 10#6->12 8#8->14 5#11->5 12#13->7 11#15->16 6#19->22 7#25->24 Step 9: 4#1->0 5#5->11 12#7->8 3#9->10 10#12->6 8#14->15 11#16->19 6#22->21 7#24->20 Step 10: 4#0->5 10#6->7 12#8->9 5#11->12 1#18->14 6#21->27 Step 11: 4#5->11 10#7->2 12#9->4 5#12->17 1#14->13 8#15->16 11#19->22 9#23->24 6#27->26 ] Multirobot solution analysis: ( total makespan = 12 total distance = 44 total trajectory = 99 average parallelism = 8.250 average distance = 3.667 average trajectory = 8.250 parallelism distribution = [ 0 0 0 0 0 1 2 4 3 2 ] distance distribution = [ 1 0 3 2 0 2 1 1 0 1 ] trajectory distribution = [ 0 1 0 1 0 1 1 1 2 1 4 ] ) 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.893 CPU/machine TIME (seconds) = 3.890 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 12 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 11 Indeterminate SAT solver calls = 0 Move executions = 198 Produced CNF variables = 33420 Produced CNF clauses = 278318 Search steps = 0 Wall clock TIME (seconds) = 6.146 CPU/machine TIME (seconds) = 6.230 ] } ] ----------------------------------------------------------------