In this paper, we focus on the theoretical and numerical aspects of network problems. For an illustration, we consider the urban traffic problems. And our effort is concentrated on the numerical questions to locate th...In this paper, we focus on the theoretical and numerical aspects of network problems. For an illustration, we consider the urban traffic problems. And our effort is concentrated on the numerical questions to locate the optimal network in a given domain (for example a town). Mainly, our aim is to find the network so as the distance between the population position and the network is minimized. Another problem that we are interested is to give an numerical approach of the Monge and Kantorovitch problems. In the literature, many formulations (see for example [1-4]) have not yet practical applications which deal with the permutation of points. Let us mention interesting numerical works due to E. Oudet begun since at least in 2002. He used genetic algorithms to identify optimal network (see [5]). In this paper we introduce a new reformulation of the problem by introducing permutations . And some examples, based on realistic scenarios, are solved.展开更多
实际交通环境规划最优路径的重要问题是无人车智能导航,而无人车全局路径规划研究主要在于模拟环境中算法求解速度的提升,考虑大部分仅路径距离最优或局限于当前道路的自身状况,本研究针对实际环境中的其他因素及其未来的变化和动态路...实际交通环境规划最优路径的重要问题是无人车智能导航,而无人车全局路径规划研究主要在于模拟环境中算法求解速度的提升,考虑大部分仅路径距离最优或局限于当前道路的自身状况,本研究针对实际环境中的其他因素及其未来的变化和动态路网中无人车全局路径规划的复杂任务,基于预测后再规划的思想提出面向实际环境的无人车驾驶系统框架,并结合深度Q学习和深度预测网络技术提出一种快速全局路径规划方法(deep prediction network and deep Q network, DP-DQN),从而利用时空、天气等道路特征数据来预测未来交通状况、求解全局最优路径。基于公开数据集的试验和评价后发现,本研究提出的方法与Dijkstra、A*等算法相比,行车时间最高降低了17.97%。展开更多
文摘In this paper, we focus on the theoretical and numerical aspects of network problems. For an illustration, we consider the urban traffic problems. And our effort is concentrated on the numerical questions to locate the optimal network in a given domain (for example a town). Mainly, our aim is to find the network so as the distance between the population position and the network is minimized. Another problem that we are interested is to give an numerical approach of the Monge and Kantorovitch problems. In the literature, many formulations (see for example [1-4]) have not yet practical applications which deal with the permutation of points. Let us mention interesting numerical works due to E. Oudet begun since at least in 2002. He used genetic algorithms to identify optimal network (see [5]). In this paper we introduce a new reformulation of the problem by introducing permutations . And some examples, based on realistic scenarios, are solved.
文摘实际交通环境规划最优路径的重要问题是无人车智能导航,而无人车全局路径规划研究主要在于模拟环境中算法求解速度的提升,考虑大部分仅路径距离最优或局限于当前道路的自身状况,本研究针对实际环境中的其他因素及其未来的变化和动态路网中无人车全局路径规划的复杂任务,基于预测后再规划的思想提出面向实际环境的无人车驾驶系统框架,并结合深度Q学习和深度预测网络技术提出一种快速全局路径规划方法(deep prediction network and deep Q network, DP-DQN),从而利用时空、天气等道路特征数据来预测未来交通状况、求解全局最优路径。基于公开数据集的试验和评价后发现,本研究提出的方法与Dijkstra、A*等算法相比,行车时间最高降低了17.97%。
