Research on an intelligent game simulation system based on road network
Publié en ligne: 12 déc. 2022
Pages: 1181 - 1192
Reçu: 08 oct. 2022
Accepté: 19 nov. 2022
© 2022 Xin Wang et al., published by Sciendo
This work is licensed under the Creative Commons Attribution 4.0 International License.
Fig. 1
Campus map and campus networkFig. 2
Shortest path distance d from each vertex to other vertices unit (per unit distance)Fig. 3
The relationship map between defender loss and attacker rationality p of 0.5 and site selection facilitiesFig. 4
Relationship map between defender loss and attacker degree of rationality change, site selection facilities of m=3Fig. 5
Relationship map between defender loss and rational degree change of attacker and site selection facilities of m=3–8Fig. 6
When m = 3, the shortest path planning is shown as blue lineFig. 7
When m = 5, the shortest path planning is shown as blue lineCampus node importance assignment
Vertex |
Importance |
Vertex |
Importance |
Vertex |
Importance |
|
1 |
318 |
9 |
220 |
17 |
228 |
2 |
302 |
10 |
99 |
18 |
371 |
3 |
59 |
11 |
91 |
19 |
138 |
4 |
128 |
12 |
144 |
20 |
253 |
5 |
105 |
13 |
404 |
21 |
287 |
6 |
303 |
14 |
100 |
22 |
312 |
7 |
305 |
15 |
38 |
|
|
8 |
270 |
16 |
127 |
|
|