Slide 5
Slide 5 text
Obstacle
0. Map to undirected graph 1. Node partitioning
3. Make route by solving Chinese
Postman Problem (CPP)
2. Edge partitioning & add shortcuts
𝑃1
= (0, 4, 8, 4, 5, 9, 5, 1, 0)
𝑃2
= (1, 2, 6, 5, 6, 7, 3, 2, 1)
𝑃3
= (8, 12, 13, 14, 13, 9, 10, 9, 8)
𝑃4
= (6, 10, 14, 15, 11, 7, 11, 10, 6)
1
0
4 5
3
2
7
6
15
14
11
10
12 13
9
8
𝑮𝟏
𝑮𝟐
𝑮𝟑 𝑮𝟒
1
0
8
4 5
9
1 3
2
7
6
5
10
12 13 14
9
8
15
14
11
10
7
6
𝑮𝟏
𝑮𝟐
𝑮𝟑
𝑮𝟒
Floor
Outline of the proposed method
ITC-CSCC 2021