================================================================ 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| = 158, paralellism = 13.167) [ Step 0: 18#2->1 9#3->10 17#5->13 13#11->4 3#14->19 10#15->16 5#20->26 4#22->23 15#33->34 6#35->36 14#38->30 2#39->44 1#46->42 Step 1: 18#1->8 7#7->0 12#9->2 9#10->11 17#13->12 10#16->15 3#19->24 4#23->31 8#25->33 5#26->27 14#30->22 1#42->41 11#43->38 Step 2: 7#0->1 12#2->3 18#8->7 17#12->18 10#15->16 14#22->23 3#24->32 5#27->28 4#31->39 8#33->25 15#34->26 6#36->35 11#38->37 2#44->43 Step 3: 7#1->2 12#3->10 9#11->12 10#16->8 17#18->22 14#23->24 8#25->33 15#26->20 5#28->29 3#32->31 6#35->27 11#37->36 4#39->44 1#41->34 2#43->38 Step 4: 7#2->3 12#10->11 9#12->18 15#20->16 17#22->21 14#24->19 6#27->28 5#29->30 3#31->39 8#33->25 1#34->26 11#36->35 2#38->37 16#40->32 4#44->49 Step 5: 10#8->9 12#11->12 15#16->15 9#18->22 14#19->14 8#25->33 1#26->27 5#30->31 16#32->24 11#35->34 2#37->36 3#39->38 Step 6: 13#4->11 18#7->8 12#12->18 14#14->13 9#22->23 16#24->19 6#28->29 5#31->32 11#34->26 2#36->35 3#38->37 Step 7: 7#3->4 13#11->10 14#13->12 15#15->7 12#18->22 16#19->14 9#23->31 11#26->20 1#27->28 6#29->30 8#33->25 2#35->34 3#37->36 Step 8: 7#4->3 15#7->0 13#10->17 14#12->11 16#14->13 11#20->16 12#22->23 8#25->26 1#28->29 6#30->38 9#31->39 5#32->40 2#34->41 3#36->35 4#49->50 Step 9: 15#0->1 7#3->2 10#9->10 14#11->4 16#13->12 11#16->15 12#23->31 8#26->27 1#29->30 3#35->34 9#39->44 5#40->32 2#41->42 Step 10: 7#2->9 14#4->3 18#8->16 10#10->11 16#12->18 11#15->7 17#21->29 8#27->35 12#31->39 3#34->41 6#38->43 2#42->46 9#44->49 Step 11: 15#1->0 14#3->4 7#9->8 10#11->12 18#16->15 17#29->28 1#30->31 5#32->40 8#35->36 12#39->44 9#49->48 ] Multirobot solution analysis: ( total makespan = 12 total distance = 108 total trajectory = 158 average parallelism = 13.167 average distance = 6.000 average trajectory = 8.778 parallelism distribution = [ 0 0 0 0 0 0 0 0 0 0 2 1 5 1 3 ] distance distribution = [ 1 1 0 2 1 4 3 1 2 1 1 ] trajectory distribution = [ 0 0 0 1 0 2 2 2 3 4 3 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) = 44.158 CPU/machine TIME (seconds) = 44.110 ] 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 = 316 Produced CNF variables = 64734 Produced CNF clauses = 614717 Search steps = 0 Wall clock TIME (seconds) = 28.441 CPU/machine TIME (seconds) = 28.510 ] } ] ----------------------------------------------------------------