Graph Convolutional Network Based Multi-Objective Meta-Deep Q-Learning for Eco-Routing

符号 图形 布线(电子设计自动化) 卷积神经网络 计算机科学 人工智能 理论计算机科学 数学 计算机网络 算术
作者
Ma Xin,Yuanchang Xie,Chunxiao Chigan
出处
期刊:IEEE Transactions on Intelligent Transportation Systems [Institute of Electrical and Electronics Engineers]
卷期号:: 1-16
标识
DOI:10.1109/tits.2023.3348034
摘要

Route selection can greatly affect vehicle fuel consumption and emissions. Finding the most fuel/energy-efficient route is known as the eco-routing problem. Existing eco-routing solutions do not effectively consider the critical traffic signal information and rely on fuel consumption models that may not be sufficiently accurate. To address the eco-routing problem in a signalized traffic network, this paper proposes a graph convolutional network based multi-objective meta-deep Q-learning (GM $^{\bm{2}}$ DQL) method. The problem is formulated as dynamic multi-objective Markov decision processes (MOMDP) and is tackled through deep reinforcement learning and meta-learning. We identify that graph convolutional network (GCN) is an efficient and suitable feature representation for a signalized traffic network. GM $^{\bm{2}}$ DQL can explore the optimal routes with respect to drivers’ different preferences on saving fuel and travel time. Through GM $^{\bm{2}}$ DQL, the agent is trained under a series of learning environments that are characterized by historical vehicle trajectories, fuel consumption data, and traffic signal data in the remote data center. The vehicle requesting eco-routing service can download the model that represents the action value function of the historical dynamic driving conditions. The model in the vehicle can quickly adapt to the most recent driving condition through online one-shot learning and predict the optimal eco-routes for the subsequent unseen driving conditions of the signalized traffic network. Extensive proof-of-concept experiments validate that GM $^{\bm{2}}$ DQL can effectively discover optimal eco-routes. It saves up to 71% travel time and 62% fuel, compared to the conventional shortest-path routing strategy that is widely used in navigation systems.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
LLLucen完成签到 ,获得积分10
刚刚
Rauf发布了新的文献求助10
1秒前
负责的问雁完成签到,获得积分10
1秒前
拓跋幻枫完成签到,获得积分10
3秒前
欢喜的夜天完成签到,获得积分10
3秒前
4秒前
wefs完成签到,获得积分10
6秒前
yebhquetxi发布了新的文献求助10
7秒前
无语的小熊猫完成签到 ,获得积分10
9秒前
11秒前
小马甲应助负责的问雁采纳,获得10
11秒前
W9发布了新的文献求助10
13秒前
Singularity发布了新的文献求助10
15秒前
xiaodengdream完成签到,获得积分10
15秒前
Solitude完成签到,获得积分10
16秒前
自觉的万言完成签到 ,获得积分10
16秒前
Jasper应助David采纳,获得10
16秒前
飘逸的白玉完成签到,获得积分10
17秒前
一一给一一的求助进行了留言
18秒前
熹禾予福完成签到,获得积分10
18秒前
无极微光应助xiaodengdream采纳,获得20
19秒前
光亮的代真完成签到 ,获得积分10
21秒前
徐梓睿完成签到,获得积分10
22秒前
哈哈哈哈发布了新的文献求助10
24秒前
科研通AI6.4应助huahua采纳,获得10
25秒前
滴迪氐媂完成签到 ,获得积分10
25秒前
荔枝完成签到,获得积分10
25秒前
无极微光应助timeless采纳,获得20
26秒前
Jason完成签到,获得积分10
27秒前
28秒前
思源应助谨慎书芹采纳,获得10
29秒前
11完成签到,获得积分10
29秒前
共勉YOUNG完成签到,获得积分10
29秒前
111完成签到,获得积分10
29秒前
30秒前
Oak完成签到 ,获得积分10
30秒前
皮皮蛙完成签到,获得积分10
31秒前
单独完成签到,获得积分10
32秒前
zhuxd完成签到 ,获得积分10
33秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
PowerCascade: A Synthetic Dataset for Cascading Failure Analysis in Power Systems 2000
Picture this! Including first nations fiction picture books in school library collections 1000
Signals, Systems, and Signal Processing 610
Unlocking Chemical Thinking: Reimagining Chemistry Teaching and Learning 555
Photodetectors: From Ultraviolet to Infrared 500
Cancer Targets: Novel Therapies and Emerging Research Directions (Part 1) 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6359097
求助须知:如何正确求助?哪些是违规求助? 8173163
关于积分的说明 17212541
捐赠科研通 5414120
什么是DOI,文献DOI怎么找? 2865393
邀请新用户注册赠送积分活动 1842773
关于科研通互助平台的介绍 1690901