================================================================ 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| = 206, paralellism = 14.714) [ Step 0: 1#24->23 6#39->44 8#22->21 10#35->36 11#7->8 13#3->4 17#11->12 18#38->30 19#33->34 20#40->32 22#2->1 Step 1: 2#19->24 3#10->11 4#42->35 6#44->45 9#20->16 10#36->37 12#25->33 13#4->3 14#15->7 15#43->48 16#9->2 17#12->13 18#30->22 19#34->26 20#32->31 22#1->0 Step 2: 2#24->32 3#11->4 4#35->36 7#14->19 8#21->29 9#16->15 10#37->38 13#3->10 16#2->1 18#22->18 19#26->27 20#31->30 Step 3: 2#32->31 4#36->37 5#46->42 6#45->50 7#19->24 8#29->28 10#38->39 11#8->16 12#33->25 13#10->9 15#48->47 17#13->14 18#18->12 19#27->35 20#30->22 Step 4: 2#31->30 4#37->38 5#42->41 7#24->32 8#28->27 11#16->20 13#9->8 16#1->2 17#14->19 18#12->11 19#35->36 20#22->18 21#5->13 Step 5: 1#23->22 5#41->42 6#50->49 7#32->40 8#27->35 10#39->31 11#20->26 12#25->33 13#8->16 16#2->9 17#19->24 18#11->10 20#18->12 21#13->14 22#0->1 Step 6: 1#22->18 4#38->39 7#40->45 10#31->32 11#26->27 12#33->34 13#16->20 14#7->0 17#24->23 18#10->17 19#36->37 20#12->11 21#14->13 22#1->8 Step 7: 2#30->31 3#4->3 4#39->40 5#42->46 6#49->50 7#45->44 8#35->36 10#32->24 11#27->28 13#20->26 15#47->48 16#9->2 17#23->22 19#37->38 20#11->10 21#13->12 22#8->16 Step 8: 2#31->23 4#40->32 5#46->42 6#50->45 7#44->39 8#36->37 10#24->19 11#28->29 13#26->27 16#2->1 17#22->21 19#38->43 20#10->9 21#12->11 22#16->20 Step 9: 1#18->12 2#23->22 3#3->10 4#32->24 5#42->35 6#45->40 8#37->38 9#15->7 10#19->14 11#29->30 12#34->33 13#27->28 15#48->47 16#1->8 19#43->44 21#11->4 22#20->26 Step 10: 1#12->11 2#22->18 4#24->19 6#40->32 8#38->43 9#7->15 10#14->6 11#30->31 12#33->34 13#28->29 15#47->48 16#8->16 19#44->45 21#4->3 22#26->27 Step 11: 1#11->4 2#18->12 4#19->14 6#32->24 7#39->38 8#43->44 10#6->5 12#34->41 13#29->30 15#48->47 16#16->20 17#21->22 19#45->40 20#9->8 21#3->2 22#27->28 Step 12: 1#4->3 2#12->11 3#10->9 4#14->13 5#35->34 7#38->37 8#44->45 9#15->7 10#5->6 11#31->39 12#41->42 15#47->48 17#22->18 19#40->32 20#8->16 21#2->1 22#28->29 Step 13: 1#3->2 2#11->4 4#13->5 7#37->36 8#45->40 11#39->44 12#42->46 13#30->22 16#20->26 18#17->10 19#32->31 20#16->8 22#29->21 ] Multirobot solution analysis: ( total makespan = 14 total distance = 115 total trajectory = 206 average parallelism = 14.714 average distance = 5.227 average trajectory = 9.364 parallelism distribution = [ 0 0 0 0 0 0 0 0 0 0 1 1 2 1 4 2 3 ] distance distribution = [ 2 2 3 2 3 1 2 2 0 3 1 ] trajectory distribution = [ 0 1 0 0 2 0 2 2 3 3 3 4 2 ] ) 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) = 43.007 CPU/machine TIME (seconds) = 43.000 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 14 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 13 Indeterminate SAT solver calls = 0 Move executions = 206 Produced CNF variables = 753660 Produced CNF clauses = 535621 Search steps = 0 Wall clock TIME (seconds) = 640.693 CPU/machine TIME (seconds) = 640.790 ] } ] ----------------------------------------------------------------