具有稳定性保证的单源单宿网络基于学习的自适应动态路由
Learning-Based Adaptive Dynamic Routing with Stability Guarantee for a Single-Origin-Single-Destination Network
AI总结:
研究单源单宿排队网络中具有稳定性保证的基于学习的自适应动态路由,提出基于分段线性函数参数化的广义最短路径策略与策略迭代算法,在确保稳定性的同时实现近最优路由且计算效率显著提升。
摘要:
我们考虑具有稳定性保证的单源单宿排队网络中基于学习的自适应动态路由。具体而言,我们研究一类广义最短路径策略,该策略可通过分段线性函数仅由两个常数进行参数化。利用Foster-Lyapunov稳定性理论,我们开发了关于参数的准则,以确保交通状态的均值有界性。随后,我们开发了一种策略迭代算法,从已实现的样本路径中学习参数。重要的是,分段线性函数既被整合到用于稳定性分析的Lyapunov函数中,又作为策略迭代的价值函数代理;因此,学习到的策略本质上确保了稳定性。最后,我们通过数值示例表明,所提出的算法学习到了近最优路由策略,其具有可接受的最优性间隙,但与标准的基于神经网络的算法相比,计算效率显著更高。
英文摘要:
We consider learning-based adaptive dynamic routing for a single-origin-single-destination queuing network with stability guarantees. Specifically, we study a class of generalized shortest path policies that can be parameterized by only two constants via a piecewise-linear function. Using the Foster-Lyapunov stability theory, we develop a criterion on the parameters to ensure mean boundedness of the traffic state. Then, we develop a policy iteration algorithm that learns the parameters from realized sample paths. Importantly, the piecewise-linear function is both integrated into the Lyapunov function for stability analysis and used as a proxy of the value function for policy iteration; hence, stability is inherently ensured for the learned policy. Finally, we demonstrate via a numerical example that the proposed algorithm learns a near-optimal routing policy with an acceptable optimality gap but significantly higher computational efficiency compared with a standard neural network-based algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。