================================================================ 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 Computed optimal makespan:13 Makespan optimal solution: Mulirobot solution: (|moves| = 123, paralellism = 9.462) [ Step 0: 6#0->6 5#5->12 13#9->3 12#13->14 2#15->16 7#23->22 10#27->34 8#36->29 Step 1: 13#3->2 6#6->0 9#8->15 5#12->11 12#14->7 2#16->9 1#18->13 4#20->25 8#29->30 10#34->33 Step 2: 6#0->6 13#2->8 2#9->3 5#11->10 1#13->14 9#15->19 7#22->29 4#25->26 8#30->31 10#33->40 Step 3: 3#1->0 2#3->2 6#6->13 13#8->15 5#10->9 9#19->23 7#29->30 8#31->32 11#37->36 10#40->39 Step 4: 3#0->6 2#2->1 12#7->8 5#9->3 6#13->18 13#15->19 9#23->24 4#26->27 8#32->25 11#36->35 10#39->38 Step 5: 2#1->7 5#3->2 3#6->13 1#14->15 6#18->21 13#19->23 9#24->31 4#27->34 7#30->29 11#35->28 10#38->37 Step 6: 5#2->1 3#13->18 6#21->22 13#23->24 8#25->32 7#29->36 9#31->38 4#34->33 10#37->30 Step 7: 2#7->14 12#8->2 1#15->16 3#18->21 6#22->29 13#24->25 10#30->23 8#32->31 7#36->35 9#38->37 Step 8: 2#14->13 3#21->22 10#23->19 13#25->20 6#29->36 4#33->26 Step 9: 5#1->0 2#13->14 1#16->9 10#19->15 4#26->25 11#28->21 8#31->30 9#37->38 Step 10: 12#2->1 10#15->8 11#21->18 3#22->23 4#25->32 8#30->29 6#36->37 9#38->39 Step 11: 5#0->6 12#1->7 10#8->2 1#9->16 2#14->15 11#18->13 13#20->25 8#29->28 7#35->36 6#37->30 9#39->40 Step 12: 10#2->3 5#6->0 11#13->14 1#16->9 3#23->22 13#25->26 8#28->21 6#30->31 4#32->39 7#36->37 9#40->33 ] Multirobot solution analysis: ( total makespan = 13 total distance = 58 total trajectory = 123 average parallelism = 9.462 average distance = 4.462 average trajectory = 9.462 parallelism distribution = [ 0 0 0 0 0 1 0 3 1 4 4 ] distance distribution = [ 1 0 2 2 0 2 1 1 2 1 ] trajectory distribution = [ 0 0 0 0 0 1 2 2 1 2 3 1 1 ] ) Phase statistics (current phase = 'root_phase') [ Phase (name = 'root_phase') [ Total SAT solver calls = 13 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 12 Indeterminate SAT solver calls = 0 Move executions = 246 Produced CNF variables = 56303 Produced CNF clauses = 323102 Search steps = 0 Wall clock TIME (seconds) = 138.799 CPU/machine TIME (seconds) = 138.930 ] ] ----------------------------------------------------------------