An Unmanned Delivery Vehicle Path-Planning Method Based on Point-Graph Joint Embedding and Dual Decoders

对偶(语法数字) 计算机科学 嵌入 对偶图 图形 人工智能 理论计算机科学 平面图 艺术 文学类
作者
Jiale Cheng,Zhiwei Ni,Wentao Liu,Qian Chen,Rui Yan
出处
期刊:Applied sciences [Multidisciplinary Digital Publishing Institute]
卷期号:15 (7): 3556-3556
标识
DOI:10.3390/app15073556
摘要

The path-planning of unmanned delivery vehicles (UDVs) has garnered significant interest due to their extensive use in contactless delivery during severe epidemics and automated delivery of parcels in diverse scenarios. However, previous studies have focused on achieving the shortest path or time based on the comprehensive cost consumption in the transportation process and ignored the impact of different customers’ different delivery time requirements in the actual interactive system. Hence, a path-planning model is presented to tackle the routing dilemma of UDVs in logistics. This new dilemma, called the unmanned delivery vehicle routing problem (UDVRP), considers the comprehensive transportation cost consumption of distribution vehicles and the customer satisfaction of each distribution point. Customer satisfaction is defined based on the delivery time requirements of different customers. This novel deep neural network model incorporates an attention mechanism and applies a method called point-graph joint embedding and dual decoders (PGDD) to solve the problem. The network’s architecture, consisting of an encoder and two decoders, directly determines the path for unmanned delivery vehicles. In addition, the model is trained offline using a deep reinforcement-learning strategy in combination with pseudo-label learning. In this scenario, the output of one decoder serves as the label for another, overseeing its learning process to choose the most effective path. Experimental results demonstrate that PGDD reduces total costs by 8.73% on average compared to state-of-the-art algorithms in 100-node scenarios, with performance gains reaching 12.5% for larger-scale problems (400 nodes), validating its superiority in complex path-planning. Additionally, PGDD improves customer satisfaction by 15.2% and achieves a response time below 90ms in real-world deployment tests. The experimental results demonstrate that the proposed method is superior to several state-of-the-art algorithms in solving the path-planning problem of unmanned distribution vehicles.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
小郭完成签到 ,获得积分10
5秒前
田野的小家庭完成签到 ,获得积分10
5秒前
内向忆南发布了新的文献求助10
10秒前
故意的问安完成签到 ,获得积分10
15秒前
星辰大海应助3D采纳,获得10
18秒前
19秒前
蔡翌文完成签到 ,获得积分10
23秒前
朱成豪发布了新的文献求助10
24秒前
25秒前
搜集达人应助科研通管家采纳,获得10
25秒前
cdercder应助科研通管家采纳,获得10
25秒前
31秒前
小马甲应助朱成豪采纳,获得10
32秒前
李凭中国弹箜篌完成签到,获得积分10
37秒前
AireenBeryl531应助Duke采纳,获得10
38秒前
微笑枫叶完成签到 ,获得积分20
42秒前
黑眼圈完成签到 ,获得积分10
42秒前
蓝桉完成签到 ,获得积分10
49秒前
wenhuanwenxian完成签到 ,获得积分10
54秒前
56秒前
3D完成签到 ,获得积分10
58秒前
雨兔儿完成签到,获得积分10
58秒前
寒冷寻桃完成签到 ,获得积分10
1分钟前
胖胖完成签到 ,获得积分0
1分钟前
李佳倩完成签到 ,获得积分10
1分钟前
1分钟前
执着的忆雪完成签到 ,获得积分10
1分钟前
Zheng完成签到 ,获得积分10
1分钟前
白色梨花完成签到 ,获得积分20
1分钟前
白菜完成签到 ,获得积分10
1分钟前
llll完成签到 ,获得积分10
1分钟前
1分钟前
zhangsan完成签到,获得积分10
1分钟前
鞑靼完成签到 ,获得积分10
1分钟前
儒雅的如松完成签到 ,获得积分10
1分钟前
1分钟前
gyx完成签到 ,获得积分10
1分钟前
微暖发布了新的文献求助10
1分钟前
dong完成签到 ,获得积分10
1分钟前
顾矜应助偏偏采纳,获得10
1分钟前
高分求助中
Thinking Small and Large 500
Algorithmic Mathematics in Machine Learning 500
Getting Published in SSCI Journals: 200+ Questions and Answers for Absolute Beginners 300
The Monocyte-to-HDL ratio (MHR) as a prognostic and diagnostic biomarker in Acute Ischemic Stroke: A systematic review with meta-analysis (P9-14.010) 240
Interpretability and Explainability in AI Using Python 200
SPECIAL FEATURES OF THE EXCHANGE INTERACTIONS IN ORTHOFERRITE-ORTHOCHROMITES 200
Null Objects from a Cross-Linguistic and Developmental Perspective 200
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3833913
求助须知:如何正确求助?哪些是违规求助? 3376342
关于积分的说明 10492639
捐赠科研通 3095861
什么是DOI,文献DOI怎么找? 1704748
邀请新用户注册赠送积分活动 820104
科研通“疑难数据库(出版商)”最低求助积分说明 771859