================================================================ 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 Solving layer: 14 Solving layer: 15 Computed optimal makespan:14 Makespan optimal solution: Mulirobot solution: (|moves| = 124, paralellism = 8.857) [ Step 0: 9#1->6 5#2->3 2#8->14 6#9->15 1#12->11 12#26->27 Step 1: 15#0->1 14#4->9 9#6->7 4#10->16 1#11->5 2#14->13 7#17->12 13#24->23 12#27->28 Step 2: 15#1->2 5#3->4 9#7->8 7#12->6 4#16->10 10#20->17 11#21->27 16#25->24 Step 3: 15#2->3 7#6->1 2#13->7 6#15->16 10#17->12 8#22->21 16#24->20 11#27->26 Step 4: 15#3->2 1#5->0 2#7->6 14#9->15 10#12->13 3#19->22 16#20->17 13#23->24 11#26->25 12#28->27 Step 5: 15#2->7 5#4->9 2#6->5 9#8->3 10#13->14 6#16->19 16#17->12 3#22->28 13#24->20 12#27->26 Step 6: 9#3->8 2#5->11 15#7->2 5#9->4 16#12->13 10#14->18 14#15->16 6#19->22 13#20->17 11#25->24 3#28->27 Step 7: 1#0->5 15#2->3 9#8->9 16#13->7 14#16->19 13#17->12 6#22->28 11#24->20 12#26->25 Step 8: 7#1->0 15#3->8 16#7->2 9#9->15 13#12->6 14#19->22 11#20->17 12#25->24 3#27->26 Step 9: 16#2->3 5#4->9 13#6->1 15#8->7 4#10->16 11#17->12 14#22->19 12#24->20 3#26->25 6#28->27 Step 10: 13#1->2 16#3->4 11#12->6 4#16->10 14#19->22 12#20->17 3#25->24 6#27->26 Step 11: 13#2->3 11#6->1 15#7->8 4#10->16 2#11->12 9#15->14 8#21->27 3#24->20 6#26->25 Step 12: 11#1->2 1#5->11 5#9->15 2#12->6 9#14->13 4#16->19 14#22->21 6#25->24 8#27->28 Step 13: 7#0->5 16#4->9 2#6->1 9#13->7 12#17->12 4#19->22 14#21->27 6#24->23 ] Multirobot solution analysis: ( total makespan = 14 total distance = 68 total trajectory = 124 average parallelism = 8.857 average distance = 4.250 average trajectory = 7.750 parallelism distribution = [ 0 0 0 0 0 1 0 4 5 3 1 ] distance distribution = [ 2 1 3 2 2 0 3 2 ] trajectory distribution = [ 0 0 1 0 3 1 2 0 4 5 ] ) Phase statistics (current phase = 'root_phase') [ Phase (name = 'root_phase') [ Total SAT solver calls = 14 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 13 Indeterminate SAT solver calls = 0 Move executions = 248 Produced CNF variables = 48104 Produced CNF clauses = 332395 Search steps = 0 Wall clock TIME (seconds) = 33.180 CPU/machine TIME (seconds) = 33.330 ] ] ----------------------------------------------------------------