================================================================ 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 Computed optimal makespan:11 Makespan optimal solution: Mulirobot solution: (|moves| = 91, paralellism = 8.273) [ Step 0: 2#3->4 10#5->13 6#11->10 3#15->16 1#25->26 9#40->32 4#43->44 Step 1: 11#2->3 2#4->11 5#9->8 6#10->17 10#13->12 1#26->27 9#32->24 7#38->30 4#44->39 Step 2: 11#3->4 5#8->7 10#12->18 1#27->28 7#30->38 8#33->34 4#39->31 Step 3: 2#11->12 6#17->10 10#18->22 9#24->23 1#28->29 4#31->32 8#34->26 7#38->43 Step 4: 5#7->15 6#10->11 2#12->18 3#16->20 10#22->21 8#26->27 1#29->30 4#32->24 Step 5: 11#4->3 6#11->12 2#18->22 3#20->26 4#24->19 8#27->28 1#30->31 Step 6: 11#3->2 6#12->18 5#15->16 4#19->14 10#21->29 2#22->30 9#23->24 3#26->27 8#28->36 7#43->48 Step 7: 4#14->13 5#16->20 6#18->22 3#27->35 10#29->28 2#30->38 1#31->23 8#36->37 Step 8: 11#2->1 4#13->12 5#20->26 6#22->30 9#24->19 10#28->27 3#35->42 8#37->36 2#38->39 7#48->49 Step 9: 4#12->11 1#23->22 5#26->25 10#27->35 6#30->38 8#36->28 2#39->40 7#49->48 Step 10: 11#1->0 4#11->4 9#19->14 5#25->33 8#28->27 10#35->34 6#38->43 2#40->32 3#42->41 ] Multirobot solution analysis: ( total makespan = 11 total distance = 57 total trajectory = 91 average parallelism = 8.273 average distance = 5.182 average trajectory = 8.273 parallelism distribution = [ 0 0 0 0 0 0 3 4 2 2 ] distance distribution = [ 0 1 1 1 1 3 1 1 0 1 ] trajectory distribution = [ 0 0 0 0 0 3 1 2 1 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) = 43.050 CPU/machine TIME (seconds) = 43.000 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 11 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 10 Indeterminate SAT solver calls = 0 Move executions = 182 Produced CNF variables = 51128 Produced CNF clauses = 363632 Search steps = 0 Wall clock TIME (seconds) = 6.576 CPU/machine TIME (seconds) = 6.690 ] } ] ----------------------------------------------------------------