清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

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.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
7秒前
king完成签到 ,获得积分10
11秒前
sakura完成签到 ,获得积分10
23秒前
32秒前
Ezio完成签到 ,获得积分10
32秒前
勤劳的渊思完成签到 ,获得积分10
37秒前
59秒前
Carol_yl完成签到 ,获得积分10
1分钟前
sa完成签到 ,获得积分10
1分钟前
科研人完成签到 ,获得积分10
1分钟前
1分钟前
简单完成签到 ,获得积分10
1分钟前
不要命的皮卡丘完成签到,获得积分10
1分钟前
1分钟前
1分钟前
chenpipi发布了新的文献求助10
2分钟前
耍酷的冷雪完成签到,获得积分10
2分钟前
李志全完成签到 ,获得积分0
2分钟前
2分钟前
不安的如天完成签到,获得积分10
2分钟前
yhjyhjyhj完成签到 ,获得积分10
2分钟前
浪浪完成签到 ,获得积分10
2分钟前
changyouhuang完成签到,获得积分10
2分钟前
2分钟前
sci完成签到 ,获得积分10
3分钟前
3分钟前
3分钟前
Sampson完成签到,获得积分10
3分钟前
激动的似狮完成签到,获得积分0
3分钟前
sevenhill完成签到 ,获得积分0
4分钟前
小冰完成签到,获得积分10
4分钟前
4分钟前
冷静的尔竹完成签到,获得积分10
4分钟前
Axel完成签到,获得积分10
4分钟前
drkyy完成签到,获得积分10
4分钟前
淡然的冬瓜完成签到,获得积分10
4分钟前
creep2020完成签到,获得积分0
4分钟前
muriel完成签到,获得积分0
4分钟前
e746700020完成签到,获得积分10
4分钟前
佳言2009完成签到 ,获得积分10
4分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
2026年中国辛酸癸酸聚乙二醇甘油酯行业市场规模及竞争格局分析报告 1000
48V Low-voltage Power Distribution Network (PDN) Architecture Industry Report, 2024 800
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
适配Micro-LED色转换的高兼容性量子点负性光刻胶制备与工艺研究 500
Direct and Iterative Linear System Solvers 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7312165
求助须知:如何正确求助?哪些是违规求助? 8928813
关于积分的说明 18923543
捐赠科研通 6973074
什么是DOI,文献DOI怎么找? 3213403
关于科研通互助平台的介绍 2381597
邀请新用户注册赠送积分活动 2191502