================================================================ 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| = 95, paralellism = 7.308) [ Step 0: 3#1->6 1#17->12 2#22->19 6#26->27 Step 1: 9#0->1 8#4->3 3#6->7 1#12->11 2#19->16 4#20->17 6#27->28 Step 2: 9#1->2 3#7->8 2#16->15 4#17->12 5#21->27 7#24->20 6#28->22 Step 3: 1#11->5 4#12->6 7#20->17 6#22->19 10#25->24 5#27->26 Step 4: 9#2->1 1#5->11 4#6->7 3#8->9 2#15->16 7#17->12 10#24->20 5#26->25 Step 5: 9#1->0 8#3->2 4#7->8 3#9->10 7#12->6 2#16->15 10#20->17 5#25->24 Step 6: 9#0->5 8#2->3 7#6->7 4#8->14 1#11->12 2#15->9 10#17->20 6#19->16 5#24->25 Step 7: 8#3->8 9#5->6 7#7->2 2#9->4 1#12->17 4#14->13 6#16->15 10#20->24 5#25->26 Step 8: 7#2->1 9#6->7 8#8->14 3#10->16 4#13->12 6#15->9 1#17->20 10#24->25 Step 9: 7#1->2 2#4->3 9#7->8 6#9->15 4#12->17 8#14->13 3#16->19 1#20->24 5#26->27 Step 10: 7#2->1 2#3->4 9#8->9 8#13->12 6#15->14 4#17->20 3#19->22 1#24->23 Step 11: 2#4->3 9#9->10 8#12->17 6#14->13 4#20->24 3#22->28 5#27->21 Step 12: 7#1->2 2#3->8 9#10->16 8#17->20 5#21->22 ] Multirobot solution analysis: ( total makespan = 13 total distance = 45 total trajectory = 95 average parallelism = 7.308 average distance = 4.500 average trajectory = 9.500 parallelism distribution = [ 0 0 0 1 1 1 3 4 3 ] distance distribution = [ 2 0 1 0 1 2 2 0 1 ] trajectory distribution = [ 0 0 0 0 0 1 0 0 4 2 3 ] ) 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) = 3.851 CPU/machine TIME (seconds) = 3.850 ] 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 = 190 Produced CNF variables = 38779 Produced CNF clauses = 320680 Search steps = 0 Wall clock TIME (seconds) = 5.111 CPU/machine TIME (seconds) = 5.210 ] } ] ----------------------------------------------------------------