国产欧美精品一区二区,中文字幕专区在线亚洲,国产精品美女网站在线观看,艾秋果冻传媒2021精品,在线免费一区二区,久久久久久青草大香综合精品,日韩美aaa特级毛片,欧美成人精品午夜免费影视

Based on the background of robot transporting passengers in large public indoor environments such as terminal buildings, the problem of dispatching order optimization of multi-autonomous manned robots is studied. Based on the idea of dispatching the network car, the adaptive Hungarian dispatching algorithm is studied for the ride demand in the terminal isolation area. Firstly, the dispatch scheduling matrix of manned robot is calculated based on the dispatch matching model of terminal bipartite graph. Secondly, the dispatch matrix considers the spatial and temporal distribution of passenger density, passenger waiting time and robot energy consumption as reference, and takes the path-time-energy as the target variable to calculate the OD matrix element value of each receiving task. At the same time, in order to explore the possibility of global dispatch, combined with the supply and demand prediction relationship, the manned robot that quickly reaches the target point is added to the dispatchable single queue. Finally, the three-dimensional simulation model of the actual dynamic business of the terminal is constructed, and the all-day dispatch simulation experiment is carried out. The results show that the proposed dispatch algorithm has better superiority and adaptability to multi-objective constrained dispatch, so as to achieve the purpose of global optimal dispatch allocation and provide decision support for efficient completion of the receiving task.