================================================================ reLOC 0.08-osaka : Multirobot Solution solver (C) Copyright 2011-2013 Pavel Surynek ---------------------------------------------------------------- Reading graph... 1,0 2,1 4,1 3,2 5,2 5,4 8,4 6,5 9,5 8,7 11,7 9,8 12,8 10,9 13,9 6,3 10,6 12,11 13,12 Reading initial arrangement... Reading goal arrangement... Undirected graph: (|V|=14 |E|=19) [ Vertex: (id = 0) {1 } Vertex: (id = 1) {0 2 4 } Vertex: (id = 2) {1 3 5 } Vertex: (id = 3) {2 6 } Vertex: (id = 4) {1 5 8 } Vertex: (id = 5) {2 4 6 9 } Vertex: (id = 6) {5 3 10 } Vertex: (id = 7) {8 11 } Vertex: (id = 8) {4 7 9 12 } Vertex: (id = 9) {5 8 10 13 } Vertex: (id = 10) {9 6 } Vertex: (id = 11) {7 12 } Vertex: (id = 12) {8 11 13 } Vertex: (id = 13) {9 12 } Edge 0: 1 <-> 0 Edge 1: 2 <-> 1 Edge 2: 4 <-> 1 Edge 3: 3 <-> 2 Edge 4: 5 <-> 2 Edge 5: 5 <-> 4 Edge 6: 8 <-> 4 Edge 7: 6 <-> 5 Edge 8: 9 <-> 5 Edge 9: 8 <-> 7 Edge 10: 11 <-> 7 Edge 11: 9 <-> 8 Edge 12: 12 <-> 8 Edge 13: 10 <-> 9 Edge 14: 13 <-> 9 Edge 15: 6 <-> 3 Edge 16: 10 <-> 6 Edge 17: 12 <-> 11 Edge 18: 13 <-> 12 ] Robot arrangement: (|R| = 5, |V| = 14) [ robot locations: {1#1 2#0 3#12 4#9 5#10 } vertex occupancy: {2#0 1#1 0#2 0#3 0#4 0#5 0#6 0#7 0#8 4#9 5#10 0#11 3#12 0#13 } ] Robot arrangement: (|R| = -1, |V| = 0) [ robot locations: {} vertex occupancy: {} ] Robot goal: (|R| = 5, |V| = 14) [ robot goals: { 1#{8} 2#{1,6,7} 3#{7,11} 4#{1,2,9,10} 5#{1,8} } vertex compatibilities: { 0@{} 1@{2,4,5} 2@{4} 3@{} 4@{} 5@{} 6@{2} 7@{2,3} 8@{1,5} 9@{4} 10@{4} 11@{3} 12@{} 13@{} } ] Solving layer: 2 Solving layer: 3 Solving layer: 4 Solving layer: 5 Solving layer: 6 Computed optimal makespan:5 Makespan optimal solution: Mulirobot solution: (|moves| = 16, paralellism = 3.200) [ Step 0: 1#1->4 4#9->5 Step 1: 2#0->1 1#4->8 4#5->6 5#10->9 Step 2: 2#1->2 4#6->10 1#8->7 5#9->5 3#12->11 Step 3: 2#2->3 5#5->4 Step 4: 2#3->6 5#4->1 1#7->8 ] Multirobot solution analysis: ( total makespan = 5 total distance = 8 total trajectory = 16 average parallelism = 3.200 average distance = 1.600 average trajectory = 3.200 parallelism distribution = [ 0 2 1 1 1 ] distance distribution = [ 2 1 0 1 ] trajectory distribution = [ 1 0 1 3 ] ) Phase statistics (current phase = 'root_phase') [ Phase (name = 'root_phase') [ Total SAT solver calls = 5 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 4 Indeterminate SAT solver calls = 0 Move executions = 32 Produced CNF variables = 4220 Produced CNF clauses = 20360 Search steps = 0 Wall clock TIME (seconds) = 0.280 CPU/machine TIME (seconds) = 0.200 ] ] ----------------------------------------------------------------