- 期刊
Optimal Path Solution based on Dijkstra Algorithm
摘要
In this paper, aiming at the selection of the optimal path through the desert, the Dijkstra algorithm is used to calculate the shortest path plan for each level map, and the node-type simplified map is used to display each level. At the same time, the relevant schemes are set according to the conditions and maps in each level, and the linear programming is used to continuously simulate and back-substitute each scheme. With the help of the running results of MATLAB and Python, the analysis and comparison are carried, and the optimal path planning of checkpoints is given on this basis.
參考文獻
Yang Guiyuan. [M].Mathematical Modeling Shanghai: Shanghai University of Finance and Economics, 2015.157-181
Yang Guiyuan, Zhu Jiaming. Evaluation of Excellent Papers in Mathematical Modeling Competition Anhui: China University of Science and Technology Press ,2013.1-12
Zhu Kuding. A Study on Changing Road Models and Changing Road Decisions of Urban Road Vehicles [D]. Liaoning University of Technology ,2018.3
Yao Dandan, he Lili. Minimum Path Algorithm [J].] for Variable Honeycomb Labyrinth Industrial Control Computers ,2013,26(10):106-107 110.
Jing Yuhai. A Study on Point of Interest Recommendation for Fusion of Multiple Situational Information Based on Location Social Network [D]. Harbin Commercial University ,2020.6