The way of survival based on heuristic Dijkstra algorithm

For the “LifeAfter” survival game problem, in order to make it smooth customs clearance, players need to meet multiple conditions, so the survival problem is abstracted into the path planning problem under multiple constraints. Aiming at this problem, we create A-D algorithm based on heuristic A * algorithm and Dijkstra algorithm. In order to reduce the complexity of computer calculation, we greatly improve the operation efficiency of the algorithm by the method of space exchange time. For the three problems in the topic, we propose three different benefit functions to optimize the global, avoid falling into the local optimal solution, guide the player under the constraints of multiple conditions, as far as possible to make the objective function value the largest (respectively: the least supply point (the sum of campfire point and food point), the path, the end point of satiation and comfort is the largest).