================================================================ 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: 1#20->26 2#35->42 5#3->4 6#15->16 10#38->30 11#33->34 13#5->13 14#2->1 Step 1: 1#26->27 2#42->46 3#7->15 4#25->33 6#16->8 7#43->38 8#9->2 9#11->10 10#30->31 12#40->39 13#13->12 14#1->0 Step 2: 1#27->28 2#46->42 3#15->16 6#8->1 7#38->37 9#10->9 10#31->32 11#34->26 13#12->11 Step 3: 1#28->29 2#42->46 3#16->20 4#33->34 7#37->36 9#9->8 10#32->24 11#26->27 13#11->10 Step 4: 1#29->30 3#20->26 4#34->41 5#4->11 7#36->35 8#2->9 9#8->16 10#24->19 11#27->28 12#39->38 13#10->3 14#0->7 Step 5: 1#30->31 3#26->27 4#41->42 5#11->12 6#1->2 7#35->34 8#9->10 9#16->20 11#28->29 13#3->4 14#7->15 Step 6: 1#31->23 3#27->28 4#42->35 5#12->18 7#34->33 8#10->11 9#20->26 10#19->14 11#29->30 12#38->37 13#4->3 14#15->16 Step 7: 1#23->24 3#28->29 4#35->27 5#18->22 6#2->9 7#33->25 8#11->12 9#26->34 10#14->13 11#30->31 12#37->36 14#16->20 Step 8: 1#24->19 3#29->30 4#27->28 5#22->23 6#9->10 8#12->18 9#34->41 11#31->39 12#36->35 13#3->4 14#20->26 Step 9: 1#19->14 2#46->42 3#30->38 4#28->29 5#23->31 10#13->12 11#39->40 12#35->34 13#4->3 14#26->27 Step 10: 1#14->13 2#42->35 4#29->30 5#31->39 6#10->9 8#18->22 10#12->11 11#40->32 12#34->33 13#3->2 14#27->28 Step 11: 1#13->12 2#35->36 4#30->31 5#39->44 6#9->8 7#25->26 8#22->23 9#41->42 11#32->24 12#33->34 13#2->1 14#28->29 Step 12: 1#12->18 3#38->39 4#31->32 6#8->16 7#26->20 9#42->46 10#11->10 12#34->35 13#1->0 14#29->21 ] 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 0 0 1 2 2 3 5 ] distance distribution = [ 2 0 0 0 1 2 3 1 2 2 ] trajectory distribution = [ 0 0 0 0 0 0 1 1 4 3 3 1 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) = 43.301 CPU/machine TIME (seconds) = 43.290 ] 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 = 139 Produced CNF variables = 274949 Produced CNF clauses = 211630 Search steps = 0 Wall clock TIME (seconds) = 83.184 CPU/machine TIME (seconds) = 83.300 ] } ] ----------------------------------------------------------------