arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2409.00754cs.AI
收藏

基于异步多智能体强化学习的协同路径规划

Cooperative Path Planning with Asynchronous Multiagent Reinforcement Learning

Tongji University(同济大学);Aalto University(阿尔托大学)

Jiaming Yin, Weixiong Rao, Yu Xiao, Keshuang Tang

AI总结:

本文针对多源-目的地最短路径问题中的异步决策挑战,提出asyn-MARL框架,通过子图划分、全局状态表示、轨迹去冗余、协同actor网络和可达性图,在合成与真实路网上实现了优于现有方法的协同路径规划。

摘要:

本文研究具有多个源-目的地对的最短路径问题(MSD-SPP),目标是最小化所有最短路径的平均行程时间。路网中固有的交通容量限制导致了车辆之间的竞争。由于MSD-SPP中的异步决策设置,即车辆(即智能体)无法在前一时间步同时完成路由动作,多智能体强化学习(MARL)模型无法提供有效且高效的路径规划协同。为解决效率问题,我们提出将整个路网划分为多个子图,随后执行区域间和区域内路径规划的两阶段过程。为解决异步问题,在所提出的asyn-MARL框架中,我们首先设计了一个全局状态,利用低维向量隐式表示多智能体的联合观测和动作。然后,我们开发了一种新颖的轨迹收集机制,以减少训练轨迹中的冗余。此外,我们设计了一种新颖的actor网络,以促进前往相同或相近目的地的车辆之间的协同,并设计了一个可达性图,旨在防止路由路径中的无限循环。在合成路网和真实路网上的评估结果表明,我们的方法优于最先进的规划方法。

英文摘要:

In this paper, we study the shortest path problem (SPP) with multiple source-destination pairs (MSD), namely MSD-SPP, to minimize average travel time of all shortest paths. The inherent traffic capacity limits within a road network contributes to the competition among vehicles. Multi-agent reinforcement learning (MARL) model cannot offer effective and efficient path planning cooperation due to the asynchronous decision making setting in MSD-SPP, where vehicles (a.k.a agents) cannot simultaneously complete routing actions in the previous time step. To tackle the efficiency issue, we propose to divide an entire road network into multiple sub-graphs and subsequently execute a two-stage process of inter-region and intra-region route planning. To address the asynchronous issue, in the proposed asyn-MARL framework, we first design a global state, which exploits a low-dimensional vector to implicitly represent the joint observations and actions of multi-agents. Then we develop a novel trajectory collection mechanism to decrease the redundancy in training trajectories. Additionally, we design a novel actor network to facilitate the cooperation among vehicles towards the same or close destinations and a reachability graph aimed at preventing infinite loops in routing paths. On both synthetic and real road networks, our evaluation result demonstrates that our approach outperforms state-of-the-art planning approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑