Academic Journal of Computing & Information Science, 2021, 4(3); doi: 10.25236/AJCIS.2021.040306.
Li Huang, Hongmei Yi
College of health, Guizhou Medical University, Guiyang 550004, Guizhou, China
This article mainly analyzes the problem of "crossing the desert" game, and transforms the problem of cross-desert game into the shortest path problem in graph theory. Taking the consumable materials and consumable funds as the weights, using Dijkstra's algorithm, path planning, dynamic planning and recursive methods, the model is established in consideration of the weather, and the optimal strategy is given to maximize the remaining funds when the destination is reached.
path planning, Dijkstra algorithm, dynamic planning
Li Huang, Hongmei Yi. Research on the Optimal Strategy of "Crossing the Desert" Game Based on Dijkstra Algorithm. Academic Journal of Computing & Information Science (2021), Vol. 4, Issue 3: 37-40. https://doi.org/10.25236/AJCIS.2021.040306.
[1] Zhou Jiaquan, Wu Jiansheng. Research on path planning based on improved fuzzy intelligent algorithm [J]. Computer Science and Applications, 2020, 10(05): 1044-1050.
[2] Liu Yuekun, Liu Xiuyan. The application of improved A* algorithm in customized bus route planning [J]. Computer Science and Applications, 2020, 10(01): 21-28.
[3] Ding Chengjun, Wang Xin, Feng Yubo, et al. AGV path planning based on particle swarm optimization algorithm [J]. Sensors and Microsystems, 2020, 39(8): 123-126.
[4] Wang Xin, Tian Yi, Jiang Hua, et al. Positioning algorithm based on dynamic planning of anchor node moving path [J]. Computer Engineering and Design, 2020, 41(8): 2135-2140.