Abstract:In order to improve the efficiency of underground locomotive dispatching and prevent locomotive collision and blockage, according to the characteristics of mine scheduling, the time Petri network model of locomotive operation is established. Aiming at the shortcomings of the original heuristic A* search algorithm, which is easy to be trapped in local optimal, a concurrency transition selection algorithm based on petri net is proposed. The concept of transition concurrency is introduced, combined it with heuristic A* search algorithm, the improved A* search algorithm is obtained. After retrospective calculation, the best path on the Petri reachable marking graph is obtained, then the optimal scheduling strategy is obtained. MATLAB modeling was carried out according to the above algorithm, and the final simulation results showed that the improved heuristic A * search algorithm effectively avoids falling into the local optimal solution. The calculated scheduling strategy resource consumption is the least, the scheduling efficiency is high, and there is no locomotive jam collision.