================================================================ 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| = 139, paralellism = 10.692) [ Step 0: 8#9->10 9#11->12 1#20->26 2#35->42 10#38->30 12#40->39 Step 1: 14#2->1 5#3->4 8#10->11 9#12->18 6#15->16 1#26->27 10#30->31 11#33->34 12#39->44 2#42->41 7#43->38 Step 2: 13#5->6 3#7->15 8#11->12 6#16->8 9#18->22 1#27->28 10#31->23 11#34->26 7#38->37 2#41->42 12#44->43 Step 3: 14#1->0 5#4->11 6#8->9 8#12->18 3#15->16 9#22->30 10#23->24 11#26->27 1#28->29 7#37->36 2#42->41 12#43->38 Step 4: 14#0->7 13#6->5 6#9->10 5#11->12 8#18->22 10#24->19 4#25->26 11#27->28 1#29->21 7#36->35 12#38->37 Step 5: 13#5->13 14#7->8 6#10->11 5#12->18 3#16->20 8#22->23 4#26->27 11#28->29 9#30->38 7#35->34 12#37->36 Step 6: 14#8->16 6#11->10 13#13->12 5#18->22 10#19->14 3#20->26 8#23->24 4#27->28 11#29->30 7#34->33 12#36->35 9#38->37 Step 7: 6#10->9 13#12->11 10#14->13 14#16->20 5#22->23 8#24->19 3#26->27 4#28->29 11#30->31 7#33->25 12#35->34 9#37->36 Step 8: 6#9->8 13#11->10 10#13->12 14#20->26 1#21->22 3#27->28 4#29->30 11#31->39 12#34->33 9#36->35 Step 9: 6#8->16 13#10->3 10#12->11 8#19->24 1#22->18 5#23->31 14#26->27 3#28->36 9#35->34 11#39->40 2#41->42 Step 10: 13#3->2 10#11->10 6#16->8 8#24->23 14#27->28 5#31->39 9#34->41 3#36->37 11#40->32 2#42->35 Step 11: 13#2->1 6#8->16 10#10->11 1#18->22 7#25->26 14#28->29 4#30->31 11#32->24 12#33->34 2#35->36 3#37->38 5#39->44 9#41->42 Step 12: 13#1->0 10#11->10 1#22->18 7#26->20 14#29->21 4#31->32 12#34->35 3#38->39 9#42->46 ] Multirobot solution analysis: ( total makespan = 13 total distance = 86 total trajectory = 139 average parallelism = 10.692 average distance = 6.143 average trajectory = 9.929 parallelism distribution = [ 0 0 0 0 0 1 0 0 1 2 5 3 1 ] distance distribution = [ 2 0 0 0 1 2 3 1 2 2 ] trajectory distribution = [ 0 0 0 0 0 0 2 0 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) = 42.653 CPU/machine TIME (seconds) = 42.610 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 13 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 12 Indeterminate SAT solver calls = 0 Move executions = 278 Produced CNF variables = 69693 Produced CNF clauses = 573750 Search steps = 0 Wall clock TIME (seconds) = 137.005 CPU/machine TIME (seconds) = 136.940 ] } ] ----------------------------------------------------------------