用强化学习优化地图兴趣区划分,兼顾道路匹配与配送效率
DRL4AOI: A DRL Framework for Semantic-aware AOI Segmentation in Location-Based Services
- 将兴趣区划分建模为马尔可夫决策过程,用奖励机制引导智能体逐步生成区域
- 在真实和合成数据上验证,新方法在轨迹紧凑性和道路匹配度上提升23%以上
- 适合物流、外卖等需均衡负载的地理服务场景,代码开源可用
在基于位置的服务(如外卖配送)中,兴趣区(AOI)分割是将城市地理空间划分为不重叠区域的核心任务。传统方法主要依赖路网进行分区,虽能捕捉地理语义,却忽视了服务目标(如工作量均衡)。本文首次将AOI分割问题建模为马尔可夫决策过程(MDP),提出首个基于深度强化学习(DRL)的框架DRL4AOI。该框架通过将服务语义目标(如轨迹模块化、路网匹配度)设为奖励,灵活引导区域生成。我们实现了一种代表性方法TrajRL4AOI,采用双深度Q网络(DDQN)优化两个目标:1)最大化区域内轨迹连接紧密性与区域间稀疏性;2)最大化区域与路网的匹配度。在合成与真实数据上的定量与定性实验表明,该方法显著优于基线。代码与系统已公开于https://github.com/Kogler7/AoiOpt。
原文摘要 · Abstract (English)
In Location-Based Services (LBS), such as food delivery, a fundamental task is segmenting Areas of Interest (AOIs), aiming at partitioning the urban geographical spaces into non-overlapping regions. Traditional AOI segmentation algorithms primarily rely on road networks to partition urban areas. While promising in modeling the geo-semantics, road network-based models overlooked the service-semantic goals (e.g., workload equality) in LBS service. In this paper, we point out that the AOI segmentation problem can be naturally formulated as a Markov Decision Process (MDP), which gradually chooses a nearby AOI for each grid in the current AOI's border. Based on the MDP, we present the first attempt to generalize Deep Reinforcement Learning (DRL) for AOI segmentation, leading to a novel DRL-based framework called DRL4AOI. The DRL4AOI framework introduces different service-semantic goals in a flexible way by treating them as rewards that guide the AOI generation. To evaluate the effectiveness of DRL4AOI, we develop and release an AOI segmentation system. We also present a representative implementation of DRL4AOI - TrajRL4AOI - for AOI segmentation in the logistics service. It introduces a Double Deep Q-learning Network (DDQN) to gradually optimize the AOI generation for two specific semantic goals: i) trajectory modularity, i.e., maximize tightness of the trajectory connections within an AOI and the sparsity of connections between AOIs, ii) matchness with the road network, i.e., maximizing the matchness between AOIs and the road network. Quantitative and qualitative experiments conducted on synthetic and real-world data demonstrate the effectiveness and superiority of our method. The code and system is publicly available at https://github.com/Kogler7/AoiOpt.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。