================================================================ 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| = 124, paralellism = 9.538) [ Step 0: 7#0->6 1#4->10 6#5->12 14#9->16 3#15->14 5#20->25 8#23->24 11#27->26 12#37->30 Step 1: 4#1->0 7#6->7 10#8->2 1#10->9 6#12->11 14#16->15 2#18->21 8#24->31 11#26->33 12#30->29 9#36->35 Step 2: 4#0->6 10#2->1 7#7->8 1#9->16 6#11->10 13#13->18 14#15->19 2#21->22 5#25->24 12#29->28 8#31->30 11#33->40 9#35->36 Step 3: 10#1->7 4#6->0 7#8->15 6#10->9 13#18->13 14#19->23 5#24->31 12#28->21 8#30->29 9#36->37 Step 4: 10#7->1 6#9->8 13#13->6 7#15->19 12#21->18 14#23->30 8#29->28 9#37->36 11#40->33 Step 5: 10#1->2 13#6->7 1#16->15 12#18->13 7#19->23 2#22->29 8#28->21 14#30->37 5#31->32 11#33->26 9#36->35 Step 6: 10#2->3 13#7->1 12#13->6 1#15->19 8#21->18 7#23->22 11#26->33 2#29->30 5#32->31 9#35->28 14#37->36 Step 7: 10#3->9 12#6->7 6#8->15 8#18->13 1#19->23 7#22->29 9#28->21 2#30->37 11#33->32 14#36->35 Step 8: 13#1->2 12#7->8 10#9->16 8#13->6 6#15->19 9#21->18 1#23->22 7#29->36 14#35->28 2#37->38 Step 9: 4#0->1 13#2->3 12#8->9 10#16->15 9#18->13 6#19->23 1#22->21 Step 10: 4#1->7 12#9->10 10#15->19 1#21->18 6#23->22 14#28->29 11#32->25 Step 11: 13#3->9 4#7->8 12#10->11 10#19->23 6#22->21 5#31->30 7#36->35 2#38->39 Step 12: 8#6->7 4#8->15 13#9->16 12#11->17 10#23->22 11#25->24 7#35->28 2#39->40 ] Multirobot solution analysis: ( total makespan = 13 total distance = 66 total trajectory = 124 average parallelism = 9.538 average distance = 4.714 average trajectory = 8.857 parallelism distribution = [ 0 0 0 0 0 0 2 2 2 3 3 0 1 ] distance distribution = [ 1 0 3 3 2 0 1 1 1 1 ] trajectory distribution = [ 1 0 0 0 0 1 1 1 4 3 1 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 = 248 Produced CNF variables = 56303 Produced CNF clauses = 318838 Search steps = 0 Wall clock TIME (seconds) = 1387.104 CPU/machine TIME (seconds) = 1387.180 ] ] ----------------------------------------------------------------