随着城市化进程的加速,城市交通堵塞问题日益显著,尤其是在人口密集的城市中心区域,如何实现行人路径的有效规划,是一个亟待解决的问题。将强化学习算法应用于多智能体协同路径规划中,可以解决传统智能体路径规划方法在复杂环境场景下...随着城市化进程的加速,城市交通堵塞问题日益显著,尤其是在人口密集的城市中心区域,如何实现行人路径的有效规划,是一个亟待解决的问题。将强化学习算法应用于多智能体协同路径规划中,可以解决传统智能体路径规划方法在复杂环境场景下应用的局限性,本文提出了一种基于改进奖励机制下的多智能体确定性策略梯度算法(Multi-Agent Deep Deterministic Policy Gradient with Reward Enhancement,MADDPG-R),在多智能体深度确定性策略梯度算法的基础上,设计一个新的奖励机制,能够有效应对多智能体环境中的复杂情况,保障系统运行的实时性。同时,本文还设计了一个动态的仿真场景,并在二维环境中进行了仿真实验,验证了该算法的有效性。展开更多
Given a graph G and a positive integer d, an L( d, 1) -labeling of G is afunction / that assigns to each vertex of G a non-negative integer such that |f(u)-f (v) | >=d ifd_c(u, v) =1;|f(u)-f(v) | >=1 if d_c(u, v...Given a graph G and a positive integer d, an L( d, 1) -labeling of G is afunction / that assigns to each vertex of G a non-negative integer such that |f(u)-f (v) | >=d ifd_c(u, v) =1;|f(u)-f(v) | >=1 if d_c(u, v) =2. The L(d, 1)-labeling number of G, lambda_d(G) is theminimum range span of labels over all such labelings, which is motivated by the channel assignmentproblem. We consider the question of finding the minimum edge span beta_d( G) of this labeling.Several classes of graphs such as cycles, trees, complete k-partite graphs, chordal graphs includingtriangular lattice and square lattice which are important to a telecommunication problem arestudied, and exact values are given.展开更多
文摘随着城市化进程的加速,城市交通堵塞问题日益显著,尤其是在人口密集的城市中心区域,如何实现行人路径的有效规划,是一个亟待解决的问题。将强化学习算法应用于多智能体协同路径规划中,可以解决传统智能体路径规划方法在复杂环境场景下应用的局限性,本文提出了一种基于改进奖励机制下的多智能体确定性策略梯度算法(Multi-Agent Deep Deterministic Policy Gradient with Reward Enhancement,MADDPG-R),在多智能体深度确定性策略梯度算法的基础上,设计一个新的奖励机制,能够有效应对多智能体环境中的复杂情况,保障系统运行的实时性。同时,本文还设计了一个动态的仿真场景,并在二维环境中进行了仿真实验,验证了该算法的有效性。
文摘Given a graph G and a positive integer d, an L( d, 1) -labeling of G is afunction / that assigns to each vertex of G a non-negative integer such that |f(u)-f (v) | >=d ifd_c(u, v) =1;|f(u)-f(v) | >=1 if d_c(u, v) =2. The L(d, 1)-labeling number of G, lambda_d(G) is theminimum range span of labels over all such labelings, which is motivated by the channel assignmentproblem. We consider the question of finding the minimum edge span beta_d( G) of this labeling.Several classes of graphs such as cycles, trees, complete k-partite graphs, chordal graphs includingtriangular lattice and square lattice which are important to a telecommunication problem arestudied, and exact values are given.
基金Supported by the Natural Science Foundation of Education Ministry of Anhui Province (No.KJ2010B138)the Foundation for the Excellent Young Talents of Anhui Province(No.2010SQRL136ZD)the Natural Science Foundation of Chuzhou University(No.2008kj013B)
