Analysis of Decision and Arrangement Problems for Desert Crossing Based on Dynamic Programming Model

DOI: https://doi.org/10.62517/jbdc.202301207

Author(s)

Wang Chunli*, Linlin Fan, Mei Zhang, Keyue Chen

Affiliation(s)

School of Tourism Data,Guilin Tourism University, Guilin, Guangxi, China,541006 *Corresponding Author.

Abstract

A playing method is aimed at the walkthrough of cross the dessert. First of all, the game is based on knowing all the weather conditions in advance, establishing the upper limit of load, initial capital, basic income, basic consumption, time and other conditional indicators, and then build dynamic programming model which is related to shortest path method. Moreover, given the weather conditions of the day to make dynamic choice, it can use Markov prediction model to forecast the weather and work out optimal revenue strategy. Finally, use game theory to analyze and renew your strategy sets, and adjust your strategy according to analysis result, putting forward reasonable and effective conclusion.

Keywords

Cross the Dessert; Dynamic Programming; Shortest Path; Markov Prediction; Game Theory

References

[1] Huming, Huangying.Research and Application of Optimization Model for Production Planning Based on Dynamic Programming[J]. Modern Computer (Pro) , 2009(7):91-93. [2] Zhang Zhenqiu. Design and Implementation of a Dynamic Programming Algorithm with Improved Time Efficiency [J]. Electronic production, 2019. [3] Cao Xianghong, Li Xinyan, Wei Xiaoge, et al. Dynamic Programming of Emergency Evacuation Path Based on Dijkstra-ACO Hybrid Algorithm[J]. Journal of Electronics and Information, 2020, v.42(06):203-210. [4] Meng Qingwei, Zhang Dongjiao. Optimization and Application research based on Dijkstra Shortest Path Algorithm [J]. E-commerce,2014:62-63. [5] Wang Shuxi, Wu Zhengxue. Improved Dijkstra Shortest Path Algorithm and its Application [J]. Computer science, 2012, 39(005):223-228. [6] Diao Jufen. Application of Markov forecasting model to economy. economist.08 (2013):217-218. [7] Shi Lei, Yao Yao. Compression and application of transition probability matrix in Markov prediction model [J]. Computer application, 2007, 27(11):2746-2749. [8] Si Shoukui Mathematical Modeling Algorithm and Application of National Defense Industry Press. [9] Shi Xianjun, Wang Kang, Xiao Zhicai, et al. Three-dimensional Bayes network testability verification model for complex systems[J]. Journal of Beijing University of Aeronautics and Astronautics, 2019, 45(7):1303-1313. [10] Qu Changwen, He You. Threat Assessment Model based on Game Theory [J]. Firepower and command and control, 1999(02):28-31. [11] Hu Zuguang. To Jointly Set Target" Game Theory Model --A Popular Illustration[J]. Business economics and management, 2001, 000(004):8-12. [12] Zhou Zhiyong, Huang Yuanqiu. The Crossing Number of K3, 3×Pn [J]. Journal of Natural Science, Hunan Normal University, 2007, 30(1):31-34. [13] Xia Xiangyu. Conditional Estimate And Yeabey's Formula [J]. Journal of Fuyang Normal University (Natural Science edition), 1996, 000(003):61-63. [14] Wang Geng, Zhang Xuejun, Zhou Mi. Using economic game theory to analyze computer games. Financial economy: second half. (2015):108. [15] Zhao Chun, Ouyang Fang. Psychological Analysis of the Needs, Motivations and Behavioral processes of Online game players[C]// The first Global ET Academic Summit. China Association of Education Technology; East China Normal University, 2006.