Environmentally-Aware Robotic Vehicle Networks Routing Computation for Last-mile Deliveries

Chengyi Qu, Rounak Singh, S. Srinivas, P. Calyam
{"title":"Environmentally-Aware Robotic Vehicle Networks Routing Computation for Last-mile Deliveries","authors":"Chengyi Qu, Rounak Singh, S. Srinivas, P. Calyam","doi":"10.1109/ICCCN58024.2023.10230089","DOIUrl":null,"url":null,"abstract":"For next-generation logistics management, robotic vehicles such as autonomous ground robots and aerial drones can alleviate the strain on last-mile distribution. They can help avoid on-road congestion, navigate hard-to-reach locations, and parallelize delivery operations. However, as the robotic vehicles move in a given delivery area, environmental barriers e.g., trees or buildings, affect air-to-air (A2A), air-to-ground (A2G), ground-to-ground (G2G) network communications on a hybrid truck-drone-robot system. In this paper, we present an environmentally-aware cooperative network routing computation scheme to avoid obstacle blockage in A2A/A2G/G2G network communications for addressing large-scale coordinated operations of the hybrid truck-drone-robot system. Specifically, we propose an offline policy-based routing algorithm and two online extensions (i.e., heuristics and learning-based) to solve the hybrid last-mile delivery vehicles communication problem in order to trade-off between end-to-end communication (i.e., increase network throughput) and delivery efficiencies (i.e., lower parcel delivery time consumption). We evaluate our scheme using state-of-the-art network routing algorithms in a trace-based simulator that integrates both the vehicles and networking sides. Performance evaluation results from our simulations show that: (i) our offline approach is Pareto-optimal among non-learning supported algorithms in a pre-delivery scenario, and (ii) our RL-based online algorithm achieves between 85–96 % of the Oracle strategy performance during delivery procedures.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN58024.2023.10230089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

For next-generation logistics management, robotic vehicles such as autonomous ground robots and aerial drones can alleviate the strain on last-mile distribution. They can help avoid on-road congestion, navigate hard-to-reach locations, and parallelize delivery operations. However, as the robotic vehicles move in a given delivery area, environmental barriers e.g., trees or buildings, affect air-to-air (A2A), air-to-ground (A2G), ground-to-ground (G2G) network communications on a hybrid truck-drone-robot system. In this paper, we present an environmentally-aware cooperative network routing computation scheme to avoid obstacle blockage in A2A/A2G/G2G network communications for addressing large-scale coordinated operations of the hybrid truck-drone-robot system. Specifically, we propose an offline policy-based routing algorithm and two online extensions (i.e., heuristics and learning-based) to solve the hybrid last-mile delivery vehicles communication problem in order to trade-off between end-to-end communication (i.e., increase network throughput) and delivery efficiencies (i.e., lower parcel delivery time consumption). We evaluate our scheme using state-of-the-art network routing algorithms in a trace-based simulator that integrates both the vehicles and networking sides. Performance evaluation results from our simulations show that: (i) our offline approach is Pareto-optimal among non-learning supported algorithms in a pre-delivery scenario, and (ii) our RL-based online algorithm achieves between 85–96 % of the Oracle strategy performance during delivery procedures.
基于环境意识的机器人车辆网络最后一英里配送路径计算
对于下一代物流管理,自主地面机器人和无人机等机器人车辆可以减轻最后一英里配送的压力。它们可以帮助避免道路拥堵,导航难以到达的地点,并使交付操作并行化。然而,当机器人车辆在给定的交付区域移动时,环境障碍(例如树木或建筑物)会影响卡车-无人机-机器人混合系统上的空对空(A2A),空对地(A2G),地对地(G2G)网络通信。针对卡车-无人机-机器人混合动力系统的大规模协同作业问题,提出了一种在A2A/A2G/G2G网络通信中避免障碍物阻塞的环境感知协同网络路由计算方案。具体而言,我们提出了一种基于离线策略的路由算法和两种在线扩展(即启发式算法和基于学习的算法)来解决混合最后一英里配送车辆通信问题,从而在端到端通信(即提高网络吞吐量)和配送效率(即降低包裹配送时间消耗)之间进行权衡。我们在基于跟踪的模拟器中使用最先进的网络路由算法评估我们的方案,该模拟器集成了车辆和网络方面。我们模拟的性能评估结果表明:(i)我们的离线方法在交付前场景的非学习支持算法中是帕累托最优的,(ii)我们基于强化学习的在线算法在交付过程中达到了Oracle策略性能的85 - 96%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信