Pebble Motion Problems and Multi-robot Path Planning on...
Transcript of Pebble Motion Problems and Multi-robot Path Planning on...
![Page 1: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/1.jpg)
Jingjin Yu
Computer Science and Artificial Intelligence Lab Massachusetts Institute of Technology
Pebble Motion Problems and Multi-robot Path Planning on Graphs
July 30, 2014
Computational Geometry Seminar
Tel Aviv University
![Page 2: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/2.jpg)
Pebble Motion Problems on Graphs
2
A connected graph: 𝐺 = 𝑉, 𝐸
![Page 3: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/3.jpg)
Pebble Motion Problems on Graphs
2
1
43
2
5
6 1
4
32
5
6
A connected graph: 𝐺 = 𝑉, 𝐸Configurations: 𝑆 = ⟨𝑠1, … , 𝑠𝑝⟩, 𝐷 = ⟨𝑑1, … , 𝑑𝑝⟩
![Page 4: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/4.jpg)
Pebble Motion Problems on Graphs
2
1
43
2
5
6 1
4
32
5
6
1 1
A connected graph: 𝐺 = 𝑉, 𝐸Configurations: 𝑆 = ⟨𝑠1, … , 𝑠𝑝⟩, 𝐷 = ⟨𝑑1, … , 𝑑𝑝⟩
A pebble move:
![Page 5: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/5.jpg)
Pebble Motion Problems on Graphs
2
1
43
2
5
6 1
4
32
5
6
1 1
A connected graph: 𝐺 = 𝑉, 𝐸Configurations: 𝑆 = ⟨𝑠1, … , 𝑠𝑝⟩, 𝐷 = ⟨𝑑1, … , 𝑑𝑝⟩
A pebble move:
Pebble Motion on Graphs (PMG): A single pebble move in a stepPebble Motion with Rotations (PMR): Multiple pebbles may move in a step
![Page 6: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/6.jpg)
A Unique Feature of PMR
3
125
3 5
12
3
4 4
PMR allows synchronous rotations of pebbles
![Page 7: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/7.jpg)
A Unique Feature of PMR
3
125
3 5
12
3
4 4
PMR allows synchronous rotations of pebbles
PMR encompasses highly constrained path planning problems
A 6 E
7 D 0 3
94 B
F C 2
1
5
8
0 2 3
4 5 6 7
A9 B
D E F
8
1
C
![Page 8: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/8.jpg)
15-Puzzle and (𝑁2 − 1)-Puzzle
4
15-puzzle: A PMG instance (𝐺, 𝑆, 𝐷) with 𝐺 a 4 × 4 grid and 𝑝 = 15.
Generalization to the (𝑵𝟐 − 𝟏)-puzzle An 𝑂(𝑁3) algorithm is easy: Move pebbles 𝑖 to its goal takes 𝑂(𝑁) moves Computing a solution with least number of moves is NP-hard (Goldreich 1984,
Ratner and Warmuth 1990) An optimal solution for the 15-puzzle can be computed quickly. Optimally
solving a 24-puzzle is still time-consuming
![Page 9: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/9.jpg)
General Graphs
5
𝐺 is 2-connected with 𝑝 = 𝑉 − 1 Configurations 𝑆1 and 𝑆2 are connected if the PMG instance (𝐺, 𝑆1, 𝑆2) is feasible Configurations 𝑆1 and 𝑆2 are adjacent if they are connected via a single move 𝑝𝑢𝑧 𝐺 : The graph formed with configurations as vertices and adjacencies as
edges Besides a few special cases, if 𝐺 is non-bipartite, then 𝑝𝑢𝑧(𝐺) has a single
component, if 𝐺 is bipartite, then 𝑝𝑢𝑧(𝐺) has two components (Wilson 1974)
General graphs with 𝑝 ≤ 𝑉 − 1 (PMG) Solvable in 𝑂(|𝑉|3) time – asymptotically tight (Kornhauser et al. 1984) Feasibility test for trees can be done in linear time (Auletta et al. 1996) Feasibility test for graphs can also be done in linear time (Goraly and Hassin
2010, Yu 2013)
![Page 10: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/10.jpg)
Applications
6
![Page 11: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/11.jpg)
Applications
6
![Page 12: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/12.jpg)
Applications
6
![Page 13: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/13.jpg)
Applications
6
![Page 14: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/14.jpg)
Applications
6
![Page 15: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/15.jpg)
Applications
6
![Page 16: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/16.jpg)
Outline
Pebble Motion Problems
Feasibility Test and Planning Algorithms for PMR The Special Case of 𝑝 = |𝑉|
Linear Time Feasibility Test
Optimal Pebble Motion Computational Complexity (NP-Hardness)
Multiflow-Based Integer Linear Programming (ILP) Algorithm
The Case of Indistinguishable Pebbles
7
![Page 17: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/17.jpg)
Outline
Pebble Motion Problems
Feasibility Test and Planning Algorithms for PMR The Special Case of 𝑝 = |𝑉|
Linear Time Feasibility Test
Optimal Pebble Motion Computational Complexity (NP-Hardness)
Multiflow-Based Integer Linear Programming (ILP) Algorithm
The Case of Indistinguishable Pebbles
7
Dr. Daniela RusMIT
Dr. Steven LaValleUIUC
![Page 18: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/18.jpg)
Rotation Induced Permutation Group
8
𝑝 = 𝑉 = 𝑛 ⇒ only rotations are possible
![Page 19: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/19.jpg)
Rotation Induced Permutation Group
8
𝑝 = 𝑉 = 𝑛 ⇒ only rotations are possible
![Page 20: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/20.jpg)
Rotation Induced Permutation Group
8
𝑝 = 𝑉 = 𝑛 ⇒ only rotations are possible
![Page 21: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/21.jpg)
Rotation Induced Permutation Group
8
𝑝 = 𝑉 = 𝑛 ⇒ only rotations are possible
A connected graph 𝐺 induces a group 𝐆 generated by cyclic rotations
![Page 22: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/22.jpg)
Rotation Induced Permutation Group
8
𝑝 = 𝑉 = 𝑛 ⇒ only rotations are possible
A connected graph 𝐺 induces a group 𝐆 generated by cyclic rotations
125
34
![Page 23: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/23.jpg)
Rotation Induced Permutation Group
8
𝑝 = 𝑉 = 𝑛 ⇒ only rotations are possible
A connected graph 𝐺 induces a group 𝐆 generated by cyclic rotations
125
34
125
34
514
23
453
12
342
51
231
45
𝐆 ≅ ℤ/5
![Page 24: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/24.jpg)
Diameters of Rotation Induced Groups
9
The diameter of a group 𝐆, 𝑑𝑖𝑎𝑚(𝐆), is the length of the longest irreducible generator product needed to reach any group element from identity
![Page 25: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/25.jpg)
Diameters of Rotation Induced Groups
9
The diameter of a group 𝐆, 𝑑𝑖𝑎𝑚(𝐆), is the length of the longest irreducible generator product needed to reach any group element from identity
125
34
514
23
453
12
342
51
231
45
![Page 26: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/26.jpg)
Diameters of Rotation Induced Groups
9
The diameter of a group 𝐆, 𝑑𝑖𝑎𝑚(𝐆), is the length of the longest irreducible generator product needed to reach any group element from identity
125
34
514
23
453
12
342
51
231
45
generators
![Page 27: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/27.jpg)
Diameters of Rotation Induced Groups
9
The diameter of a group 𝐆, 𝑑𝑖𝑎𝑚(𝐆), is the length of the longest irreducible generator product needed to reach any group element from identity
125
34
𝑑𝑖𝑎𝑚 𝐆 = 𝟐
514
23
453
12
342
51
231
45
generators
![Page 28: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/28.jpg)
Diameters of Rotation Induced Groups, cont.
10
Theorem (Diameter of a Graph Induced Permutation Group). Let 𝐆 be thegroup for a graph 𝐺 = (𝑉, 𝐸) with 𝑉 = 𝑛. Then 𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2).
![Page 29: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/29.jpg)
Diameters of Rotation Induced Groups, cont.
10
Theorem (Diameter of a Graph Induced Permutation Group). Let 𝐆 be thegroup for a graph 𝐺 = (𝑉, 𝐸) with 𝑉 = 𝑛. Then 𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2).
𝐆 ≅ {𝟏}
𝑑𝑖𝑎𝑚 𝐆 = 1
![Page 30: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/30.jpg)
Diameters of Rotation Induced Groups, cont.
10
Theorem (Diameter of a Graph Induced Permutation Group). Let 𝐆 be thegroup for a graph 𝐺 = (𝑉, 𝐸) with 𝑉 = 𝑛. Then 𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2).
𝐆 ≅ {𝟏}
𝑑𝑖𝑎𝑚 𝐆 = 1
𝐆 ≅ ℤ/𝑛
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛)
![Page 31: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/31.jpg)
Diameters of Rotation Induced Groups, cont.
10
Theorem (Diameter of a Graph Induced Permutation Group). Let 𝐆 be thegroup for a graph 𝐺 = (𝑉, 𝐸) with 𝑉 = 𝑛. Then 𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2).
𝐆 ≅ {𝟏}
𝑑𝑖𝑎𝑚 𝐆 = 1
𝐆 ≅ 𝐀𝐧 or 𝐒𝐧
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2)
𝐆 ≅ ℤ/𝑛
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛)
![Page 32: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/32.jpg)
Diameters of Rotation Induced Groups, cont.
10
Theorem (Diameter of a Graph Induced Permutation Group). Let 𝐆 be thegroup for a graph 𝐺 = (𝑉, 𝐸) with 𝑉 = 𝑛. Then 𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2).
𝐆 ≅ {𝟏}
𝑑𝑖𝑎𝑚 𝐆 = 1
𝐆 ≅ 𝐀𝐧 or 𝐒𝐧
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2)
𝐆 ≅ ℤ/𝑛
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛)
𝐆 ≅ 𝐒𝐧
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2)
![Page 33: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/33.jpg)
Diameters of Rotation Induced Groups, cont.
10
Theorem (Diameter of a Graph Induced Permutation Group). Let 𝐆 be thegroup for a graph 𝐺 = (𝑉, 𝐸) with 𝑉 = 𝑛. Then 𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2).
𝐆 ≅ {𝟏}
𝑑𝑖𝑎𝑚 𝐆 = 1
𝐆 ≅ 𝐀𝐧 or 𝐒𝐧
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2)
𝐆 ≅ ℤ/𝑛
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛)
𝐆 ≅ 𝐒𝐧
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2)
𝐆 for a general graph 𝐺 is the direct product of these groups
![Page 34: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/34.jpg)
Diameters of Rotation Induced Groups, cont.
10
Theorem (Diameter of a Graph Induced Permutation Group). Let 𝐆 be thegroup for a graph 𝐺 = (𝑉, 𝐸) with 𝑉 = 𝑛. Then 𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2).
𝐆 ≅ {𝟏}
𝑑𝑖𝑎𝑚 𝐆 = 1
𝐆 ≅ 𝐀𝐧 or 𝐒𝐧
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2)
𝐆 ≅ ℤ/𝑛
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛)
𝐆 ≅ 𝐒𝐧
𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2)
𝐆 for a general graph 𝐺 is the direct product of these groups
![Page 35: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/35.jpg)
The Case of Hairless Cactus
11
Definition (Cycle Similarity). Two configurations are cycle similar if thesame pebble in the two configurations shares one common cycle.
3 24
1
76
5
89
10
11
121413
5 47
1 2
63
8
910
11
12
14
13
![Page 36: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/36.jpg)
The Case of Hairless Cactus
11
Definition (Cycle Similarity). Two configurations are cycle similar if thesame pebble in the two configurations shares one common cycle.
3 24
1
76
5
89
10
11
121413
5 47
1 2
63
8
910
11
12
14
13
Lemma (Arrangement). Given a separable G with each edge on exactly one cycle and configurations 𝑆 and 𝐷, in 𝑂(𝑛2) moves, a configuration that is cycle similar to 𝐷 is reachable from 𝑆.
![Page 37: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/37.jpg)
The Case of Hairless Cactus
11
Definition (Cycle Similarity). Two configurations are cycle similar if thesame pebble in the two configurations shares one common cycle.
3 24
1
76
5
89
10
11
121413
5 47
1 2
63
8
910
11
12
14
13
Lemma (Arrangement). Given a separable G with each edge on exactly one cycle and configurations 𝑆 and 𝐷, in 𝑂(𝑛2) moves, a configuration that is cycle similar to 𝐷 is reachable from 𝑆.
![Page 38: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/38.jpg)
The Case of Hairless Cactus, cont.
12
Lemma (Rearrangement). The pebbles arranged according to the Arrangement Lemma can be rearranged such that the resulting configuration is the same as 𝐷 or differ from 𝐷 by a fixed transposition of two neighboring pebbles in 𝐷. Rearrangement requires 𝑂(𝑛2) moves.
![Page 39: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/39.jpg)
The Case of Hairless Cactus, cont.
12
Lemma (Rearrangement). The pebbles arranged according to the Arrangement Lemma can be rearranged such that the resulting configuration is the same as 𝐷 or differ from 𝐷 by a fixed transposition of two neighboring pebbles in 𝐷. Rearrangement requires 𝑂(𝑛2) moves.
![Page 40: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/40.jpg)
The Case of Hairless Cactus, cont.
13
Constructive proof of 𝐆 ≥ 𝐀𝐧 and 𝑑𝑖𝑎𝑚 𝐆 = 𝑂(𝑛2) for a cactus 𝐺 Build a cycle tree of the cycles on the cactus Arrange 𝑆 to 𝐷′ that it is cycle similar to 𝐷 in 𝑂(𝑛2) steps Rearrange 𝐷′ to 𝐷′′ that is identical to 𝐷 or differ from 𝐷 only at two adjacent
pebbles, again in 𝑂(𝑛2) steps
![Page 41: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/41.jpg)
Algorithm for Feasibility and Path Planning
14
![Page 42: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/42.jpg)
Algorithm for Feasibility and Path Planning
14
Move 𝑆 and 𝐷 so that the pebbles occupy the same set of vertices and concentrate the pebbles to 2-edge-connected components
![Page 43: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/43.jpg)
Algorithm for Feasibility and Path Planning
14
Move 𝑆 and 𝐷 so that the pebbles occupy the same set of vertices and concentrate the pebbles to 2-edge-connected components
𝐺 is contracted into a skeleton tree by shrinking 2-edge-connected components
![Page 44: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/44.jpg)
Algorithm for Feasibility and Path Planning
14
Move 𝑆 and 𝐷 so that the pebbles occupy the same set of vertices and concentrate the pebbles to 2-edge-connected components
𝐺 is contracted into a skeleton tree by shrinking 2-edge-connected components Apply the PMT (PMG with 𝐺 being a tree) feasibility test (Auletta et al. 1996)
![Page 45: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/45.jpg)
Algorithm for Feasibility and Path Planning
14
Move 𝑆 and 𝐷 so that the pebbles occupy the same set of vertices and concentrate the pebbles to 2-edge-connected components
𝐺 is contracted into a skeleton tree by shrinking 2-edge-connected components Apply the PMT (PMG with 𝐺 being a tree) feasibility test (Auletta et al. 1996) This yields in linear time the feasibility and the set of pebble exchanges needed
to take 𝑆 to 𝐷
![Page 46: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/46.jpg)
Algorithm for Feasibility and Path Planning
14
Move 𝑆 and 𝐷 so that the pebbles occupy the same set of vertices and concentrate the pebbles to 2-edge-connected components
𝐺 is contracted into a skeleton tree by shrinking 2-edge-connected components Apply the PMT (PMG with 𝐺 being a tree) feasibility test (Auletta et al. 1996) This yields in linear time the feasibility and the set of pebble exchanges needed
to take 𝑆 to 𝐷 Each pebble exchange is doable in 𝑂(𝑛) steps and 𝑂(𝑛2) total pebble moves,
yielding an 𝑂(𝑛3) planning algorithm
![Page 47: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/47.jpg)
Outline
Pebble Motion Problems
Feasibility Test and Planning Algorithms for PMR The Special Case of 𝑝 = |𝑉|
Linear Time Feasibility Test
Optimal Pebble Motion Computational Complexity (NP-Hardness)
Multiflow-Based Integer Linear Programming (ILP) Algorithm
The Case of Indistinguishable Pebbles
15
![Page 48: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/48.jpg)
Optimal Pebble Motion Problems
16
Let 𝑡𝑖 be the arrival time of pebble 𝑖 at its goal (the pebble is then fixed) Minimum makespan: Find a plan that minimizes 𝒎𝒂𝒙 𝒕𝒊 Minimum total arrival time: Find a plan that minimizes ∑𝒕𝒊 Minimum total distance: Find a plan that minimizes the total number of edges
travelled by all pebbles
![Page 49: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/49.jpg)
Optimal Pebble Motion Problems
16
Proposition (Incompatibility of Objectives). In general, any two of theminimum makespan, minimum total arrival time, and minimum totaldistance objectives cannot be simultaneous satisfied.
1
23
4
1
2 3
4
Let 𝑡𝑖 be the arrival time of pebble 𝑖 at its goal (the pebble is then fixed) Minimum makespan: Find a plan that minimizes 𝒎𝒂𝒙 𝒕𝒊 Minimum total arrival time: Find a plan that minimizes ∑𝒕𝒊 Minimum total distance: Find a plan that minimizes the total number of edges
travelled by all pebbles
![Page 50: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/50.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
![Page 51: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/51.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
![Page 52: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/52.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
Minimum makespan PMR
![Page 53: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/53.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
Minimum makespan PMR
1 1
![Page 54: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/54.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
Minimum makespan PMR
1 1
2 2
3 3
4 4
![Page 55: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/55.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
Minimum makespan PMR
𝐶1
1 1
2 2
3 3
4 4
![Page 56: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/56.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
Minimum makespan PMR
𝐶1
1 1
2 2
3 3
4 4
𝐶2
![Page 57: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/57.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
Minimum makespan PMR
𝐶1
1 1
2 2
3 3
4 4
𝐶2
𝐶3
![Page 58: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/58.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
Minimum makespan PMR
𝐶1
1 1
2 2
3 3
4 4
𝐶2
𝐶3
𝐶1 𝐶3𝐶2
![Page 59: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/59.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
Minimum makespan PMR
𝐶1
1 1
2 2
3 3
4 4
𝐶2
𝐶3
𝐶1 𝐶3𝐶2
A possible assignment:𝑥1 = 𝑥2 = 𝑥3 = 𝑥4 = 1
![Page 60: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/60.jpg)
NP-Hardness of Optimal PMR Problems
17
Theorem (NP-Hardness). Planning paths for PMR to minimize makespan,total arrival time, and total distance objectives are all NP-hard.
Variables: 𝑥1, … , 𝑥4, Clauses: 𝑥1 ∨ ¬𝑥3 ∨ 𝑥4, ¬𝑥1 ∨ 𝑥2 ∨ ¬𝑥4, ¬𝑥2 ∨ 𝑥3 ∨ 𝑥43SAT
Minimum makespan PMR
𝐶1
1 1
2 2
3 3
4 4
𝐶2
𝐶3
𝐶1 𝐶3𝐶2
A possible assignment:𝑥1 = 𝑥2 = 𝑥3 = 𝑥4 = 1
![Page 61: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/61.jpg)
NP-Hardness of Optimal PMR Problems, cont.
18
Corollary. Planning for PMR to minimize makespan remains NP-Hard fortwo types of pebbles.
B
A A
A A
A A
A A
B
B
B BB
![Page 62: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/62.jpg)
Algorithmic Solution for Optimal PMR
19
Key idea: time expansion
![Page 63: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/63.jpg)
Algorithmic Solution for Optimal PMR
19
Key idea: time expansion
𝑎1 𝑎2′
𝑎2𝑎1′
![Page 64: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/64.jpg)
Algorithmic Solution for Optimal PMR
19
Key idea: time expansion
1 1’ 2 2’t = 0 T=4 4’3 3’
𝑎1 𝑎2′
𝑎2𝑎1′
![Page 65: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/65.jpg)
Algorithmic Solution for Optimal PMR
19
Key idea: time expansion
1 1’ 2 2’t = 0 T=4 4’3 3’
𝑎1 𝑎2′
𝑎2𝑎1′
12
3
4
2
1
3,4
![Page 66: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/66.jpg)
Algorithmic Solution for Optimal PMR
19
Key idea: time expansion
1 1’ 2 2’t = 0 T=4 4’3 3’
𝑎1 𝑎2′
𝑎2𝑎1′
12
3
4
2
1
3,4
![Page 67: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/67.jpg)
Algorithmic Solution for Optimal PMR
19
Key idea: time expansion
1 1’ 2 2’t = 0 T=4 4’3 3’
𝑎1 𝑎2′
𝑎2𝑎1′
12
3
4
2
1
3,4
Theorem. Fixing a natural number 𝑇, a PMR instance admits a solutionwith at most 𝑇 time steps if and only if the corresponding time-expandednetwork with 𝑇 periods admits a solution consisting of disjoint paths.
![Page 68: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/68.jpg)
Algorithm for Minimum Makespan PMR
20
Pick an initial 𝑇Build the time-expanded network
Set up an ILP model
Run optimizerFeasible?
No 𝑇 = 𝑇 + 1
Yes
Return the path set
![Page 69: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/69.jpg)
Algorithm for Minimum Makespan PMR
20
Pick an initial 𝑇Build the time-expanded network
Set up an ILP model
Run optimizerFeasible?
No 𝑇 = 𝑇 + 1
Yes
Return the path set
Additional heuristics Reachability analysis Divide and conquer
![Page 70: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/70.jpg)
Computational Performance (MinTime MPPG)
21
16 × 16 grid, 60 pebbles
Longest path Length = 22Computed min time = 22
Running time: < 1 second
Problems can be solved under 1 second: ~100 pebbles, ~1000 vertices100+ times faster than the next best (Surynek 2012)
![Page 71: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/71.jpg)
Outline
Pebble Motion Problems
Feasibility Test and Planning Algorithms for PMR The Special Case of 𝑝 = |𝑉|
Linear Time Feasibility Test
Optimal Pebble Motion Computational Complexity (NP-Hardness)
Multiflow-Based Integer Linear Programming (ILP) Algorithm
The Case of Indistinguishable Pebbles
22
![Page 72: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/72.jpg)
The Case of Indistinguishable Pebbles
23
Always feasible In fact, many optimal versions (MinTime, , …) are efficiently
solvable.MinTotalDist
![Page 73: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/73.jpg)
The Case of Indistinguishable Pebbles
23
Always feasible In fact, many optimal versions (MinTime, , …) are efficiently
solvable.MinTotalDist
![Page 74: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/74.jpg)
Compute lengths of all shortest paths between starts and goals
Computing a Shortest Unscheduled Path Set
24
![Page 75: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/75.jpg)
Compute lengths of all shortest paths between starts and goals
Computing a Shortest Unscheduled Path Set
24
𝑣1
𝑣2
𝑣3
𝑣4
𝑣6
𝑣5
![Page 76: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/76.jpg)
Compute lengths of all shortest paths between starts and goals
Computing a Shortest Unscheduled Path Set
24
𝑣1
𝑣2
𝑣3
𝑣4
𝑣6
𝑣5
𝑣4 𝑣5 𝑣6
𝑣1 5 6 6
𝑣2 4 5 5
𝑣3 4 5 5
![Page 77: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/77.jpg)
Compute lengths of all shortest paths between starts and goals
Run Hungarian algorithm to find an optimal pairing
Computing a Shortest Unscheduled Path Set
24
𝑣1
𝑣2
𝑣3
𝑣4
𝑣6
𝑣5
𝑣4 𝑣5 𝑣6
𝑣1 5 6 6
𝑣2 4 5 5
𝑣3 4 5 5
![Page 78: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/78.jpg)
Compute lengths of all shortest paths between starts and goals
Run Hungarian algorithm to find an optimal pairing
Computing a Shortest Unscheduled Path Set
24
𝑣1
𝑣2
𝑣3
𝑣4
𝑣6
𝑣5
𝑣4 𝑣5 𝑣6
𝑣1 5 6 6
𝑣2 4 5 5
𝑣3 4 5 5
![Page 79: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/79.jpg)
Compute lengths of all shortest paths between starts and goals
Run Hungarian algorithm to find an optimal pairing
Computing a Shortest Unscheduled Path Set
24
𝑣1
𝑣2
𝑣3
𝑣4
𝑣6
𝑣5
𝑣4 𝑣5 𝑣6
𝑣1 5 6 6
𝑣2 4 5 5
𝑣3 4 5 5
![Page 80: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/80.jpg)
Compute lengths of all shortest paths between starts and goals
Run Hungarian algorithm to find an optimal pairing
Computing a Shortest Unscheduled Path Set
24
𝑣1
𝑣2
𝑣3
𝑣4
𝑣6
𝑣5
𝑣4 𝑣5 𝑣6
𝑣1 5 6 6
𝑣2 4 5 5
𝑣3 4 5 5
![Page 81: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/81.jpg)
Compute lengths of all shortest paths between starts and goals
Run Hungarian algorithm to find an optimal pairing
Computing a Shortest Unscheduled Path Set
24
optimal (shortest) but unscheduled path set𝑄 = 𝑞1, … , 𝑞𝑛𝑞3
𝑞2
𝑞1
𝑣1
𝑣2
𝑣3
𝑣4
𝑣6
𝑣5
𝑣4 𝑣5 𝑣6
𝑣1 5 6 6
𝑣2 4 5 5
𝑣3 4 5 5
![Page 82: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/82.jpg)
Properties of Optimal Unscheduled Path Set
Lemma: A shortest path set 𝑄 = { 𝑞1, … , 𝑞𝑝} induces a directed acyclic
graph structure.
25
![Page 83: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/83.jpg)
Properties of Optimal Unscheduled Path Set
Lemma: A shortest path set 𝑄 = { 𝑞1, … , 𝑞𝑝} induces a directed acyclic
graph structure.
25
![Page 84: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/84.jpg)
Properties of Optimal Unscheduled Path Set
Lemma: A shortest path set 𝑄 = { 𝑞1, … , 𝑞𝑝} induces a directed acyclic
graph structure.
25
![Page 85: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/85.jpg)
Properties of Optimal Unscheduled Path Set
Lemma: A shortest path set 𝑄 = { 𝑞1, … , 𝑞𝑝} induces a directed acyclic
graph structure.
25
![Page 86: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/86.jpg)
Properties of Optimal Unscheduled Path Set
Lemma: A shortest path set 𝑄 = { 𝑞1, … , 𝑞𝑝} induces a directed acyclic
graph structure.
25
![Page 87: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/87.jpg)
Standalone Goal Vertex
Corollary: Fixing a shortest path set 𝑄, there exists a goal vertex thatdoes not lie on any other paths (i.e., it is not in the middle of anotherpath of 𝑄).
26
![Page 88: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/88.jpg)
Standalone Goal Vertex
Corollary: Fixing a shortest path set 𝑄, there exists a goal vertex thatdoes not lie on any other paths (i.e., it is not in the middle of anotherpath of 𝑄).
26
![Page 89: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/89.jpg)
Standalone Goal Vertex
Corollary: Fixing a shortest path set 𝑄, there exists a goal vertex thatdoes not lie on any other paths (i.e., it is not in the middle of anotherpath of 𝑄).
26
![Page 90: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/90.jpg)
Standalone Goal Vertex
Corollary: Fixing a shortest path set 𝑄, there exists a goal vertex thatdoes not lie on any other paths (i.e., it is not in the middle of anotherpath of 𝑄).
26
![Page 91: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/91.jpg)
Standalone Goal Vertex
Corollary: Fixing a shortest path set 𝑄, there exists a goal vertex thatdoes not lie on any other paths (i.e., it is not in the middle of anotherpath of 𝑄).
26
![Page 92: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/92.jpg)
Scheduling the Paths (Coordination and Control)
27
![Page 93: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/93.jpg)
Scheduling the Paths (Coordination and Control)
27
![Page 94: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/94.jpg)
Scheduling the Paths (Coordination and Control)
27
![Page 95: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/95.jpg)
Scheduling the Paths (Coordination and Control)
27
0
1
32
4
![Page 96: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/96.jpg)
Scheduling the Paths (Coordination and Control)
27
0
1
32
4
5
1
3
2
4
6
![Page 97: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/97.jpg)
Scheduling the Paths (Coordination and Control)
27
0
1
32
4
5
1
3
2
4
6
![Page 98: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/98.jpg)
Scheduling the Paths (Coordination and Control)
27
0
1
32
4
5
1
3
2
4
6
2
3
4
5
76
8
![Page 99: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/99.jpg)
Scheduling the Paths (Coordination and Control)
27
0
1
32
4
5
1
3
2
4
6
2
3
4
5
76
8
Theorem (Bounded Completion Time for Distance Optimal Paths): Given aPMR instance with indistinguishable pebbles, there exists a minimumtotal distance plan with a completion time of no more than 𝒑 + ℓ − 𝟏, inwhich 𝑝 is the number of pebbles and ℓ is the longest distance betweenany start and goal vertices. Moreover, the 𝒑 + ℓ − 𝟏 time bound is tight.
![Page 100: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/100.jpg)
Algorithm 1 Distance Optimal Planner for PMR with Indistinguishable Pebbles
Input: Graph 𝐺, start vertices 𝑥𝐼, goal vertices 𝑥𝐺. Output: path set 𝑃 = { 𝐩1, … , 𝐩𝑝}
1 Compute 𝑑𝑖𝑠𝑡(𝑢, 𝑣) for all 𝑢 ∈ 𝑥𝐼 , 𝑣 ∈ 𝑥𝐺
2 Run Hungarian method to pair up pebbles and goals, yielding unscheduled paths 𝑄 = {𝑞1, … , 𝑞𝑝}
3 for each 𝑡 = 1: 𝑝 standalone goal (a goal of a path 𝑞𝑖 that is not on other paths 𝑞𝑗 ≠ 𝑞𝑖)
4 Do a backward search (limited to edges of the path set) for a closest vehicle
5 Set the vehicle to start at time 𝑡 − 1, yielding a scheduled path 𝐩𝑡
6 return 𝑃 = {𝐩1, … , 𝐩𝑝}
The Algorithm and Decentralization
28
![Page 101: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/101.jpg)
Algorithm 1 Distance Optimal Planner for PMR with Indistinguishable Pebbles
Input: Graph 𝐺, start vertices 𝑥𝐼, goal vertices 𝑥𝐺. Output: path set 𝑃 = { 𝐩1, … , 𝐩𝑝}
1 Compute 𝑑𝑖𝑠𝑡(𝑢, 𝑣) for all 𝑢 ∈ 𝑥𝐼 , 𝑣 ∈ 𝑥𝐺
2 Run Hungarian method to pair up pebbles and goals, yielding unscheduled paths 𝑄 = {𝑞1, … , 𝑞𝑝}
3 for each 𝑡 = 1: 𝑝 standalone goal (a goal of a path 𝑞𝑖 that is not on other paths 𝑞𝑗 ≠ 𝑞𝑖)
4 Do a backward search (limited to edges of the path set) for a closest vehicle
5 Set the vehicle to start at time 𝑡 − 1, yielding a scheduled path 𝐩𝑡
6 return 𝑃 = {𝐩1, … , 𝐩𝑝}
The Algorithm and Decentralization
28
Running time: 𝑂(𝑝3) – determined by the Hungarian algorithm
![Page 102: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/102.jpg)
Algorithm 1 Distance Optimal Planner for PMR with Indistinguishable Pebbles
Input: Graph 𝐺, start vertices 𝑥𝐼, goal vertices 𝑥𝐺. Output: path set 𝑃 = { 𝐩1, … , 𝐩𝑝}
1 Compute 𝑑𝑖𝑠𝑡(𝑢, 𝑣) for all 𝑢 ∈ 𝑥𝐼 , 𝑣 ∈ 𝑥𝐺
2 Run Hungarian method to pair up pebbles and goals, yielding unscheduled paths 𝑄 = {𝑞1, … , 𝑞𝑝}
3 for each 𝑡 = 1: 𝑝 standalone goal (a goal of a path 𝑞𝑖 that is not on other paths 𝑞𝑗 ≠ 𝑞𝑖)
4 Do a backward search (limited to edges of the path set) for a closest vehicle
5 Set the vehicle to start at time 𝑡 − 1, yielding a scheduled path 𝐩𝑡
6 return 𝑃 = {𝐩1, … , 𝐩𝑝}
The Algorithm and Decentralization
28
Running time: 𝑂(𝑝3) – determined by the Hungarian algorithm
The scheduling/control portion can be fully decentralized Requires only local (distance 2) communication Retains the 𝑝 + ℓ − 1 completion time Generally yields better than 𝑝 + ℓ − 1 completion time
![Page 103: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/103.jpg)
Algorithm 1 Distance Optimal Planner for PMR with Indistinguishable Pebbles
Input: Graph 𝐺, start vertices 𝑥𝐼, goal vertices 𝑥𝐺. Output: path set 𝑃 = { 𝐩1, … , 𝐩𝑝}
1 Compute 𝑑𝑖𝑠𝑡(𝑢, 𝑣) for all 𝑢 ∈ 𝑥𝐼 , 𝑣 ∈ 𝑥𝐺
2 Run Hungarian method to pair up pebbles and goals, yielding unscheduled paths 𝑄 = {𝑞1, … , 𝑞𝑝}
3 for each 𝑡 = 1: 𝑝 standalone goal (a goal of a path 𝑞𝑖 that is not on other paths 𝑞𝑗 ≠ 𝑞𝑖)
4 Do a backward search (limited to edges of the path set) for a closest vehicle
5 Set the vehicle to start at time 𝑡 − 1, yielding a scheduled path 𝐩𝑡
6 return 𝑃 = {𝐩1, … , 𝐩𝑝}
The Algorithm and Decentralization
28
Running time: 𝑂(𝑝3) – determined by the Hungarian algorithm
The scheduling/control portion can be fully decentralized Requires only local (distance 2) communication Retains the 𝑝 + ℓ − 1 completion time Generally yields better than 𝑝 + ℓ − 1 completion time
Generalizes to arbitrary roadmaps
![Page 104: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/104.jpg)
Computational Performance
29
http://msl.cs.uiuc.edu/~jyu18/pe/formation.html - JAVA plugin required
![Page 105: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/105.jpg)
Computational Performance
29
~100 pebbles, ~1000 vertices, running time <0.01 second
Problems can be solved under 1 second: ~800 pebbles, ~10000 vertices
http://msl.cs.uiuc.edu/~jyu18/pe/formation.html - JAVA plugin required
![Page 106: Pebble Motion Problems and Multi-robot Path Planning on Graphspeople.csail.mit.edu/jingjin/files/Talk.Tel-Aviv-CG-Jul-14.pdf · General Graphs 5 𝐺is 2-connected with ञ༞𝑉༘Յ](https://reader035.fdocuments.us/reader035/viewer/2022071003/5fbfee47f3ba104fa70e390a/html5/thumbnails/106.jpg)
Summary
Pebble Motion Problems
Feasibility Test and Planning Algorithms for PMR The Special Case of 𝑝 = |𝑉|
Linear Time Feasibility Test
Optimal Pebble Motion Computational Complexity (NP-Hardness)
Multiflow-Based Integer Linear Programming (ILP) Algorithm
The Case of Indistinguishable Pebbles
30