arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.00829cs.DS
收藏

途中卡车-无人机配送问题

The En Route Truck-Drone Delivery Problem

Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov

AI总结:

研究直线匀速行驶的单卡车搭载有限能力无人机的协同配送问题,证明最大化配送数为强NP难,提出2-近似算法及一类非平凡实例的最优算法。

摘要:

我们研究卡车-无人机协同配送问题,场景为单辆搭载无人机的卡车沿直线轨迹/街道匀速行驶。向位于平面内且不在卡车轨迹上的客户配送由无人机完成,该无人机运载能力和飞行航程有限,且在卡车上时可充电。我们证明,即便在这一简单场景下,最大化配送数量的问题仍是强NP难的。我们提出了该问题的一个2-近似算法,以及针对一类非平凡实例的最优算法。

英文摘要:

We study the truck-drone cooperative delivery problem in a setting where a single truck carrying a drone travels at constant speed on a straight-line trajectory/street. Delivery to clients located in the plane and not on the truck's trajectory is performed by the drone, which has limited carrying capacity and flying range, and whose battery can be recharged when on the truck. We show that the problem of maximizing the number of deliveries is strongly NP-hard even in this simple setting. We present a 2-approximation algorithm for the problem, and an optimal algorithm for a non-trivial family of instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑