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.

翻译：我们研究卡车-无人机协同配送问题，其中一辆携带无人机的卡车沿直线轨迹/街道以恒定速度行驶。对于位于平面内且不在卡车轨迹上的客户，由无人机进行配送。无人机具有有限的载货能力和飞行范围，且在卡车上时可对其电池进行充电。我们证明，即使在这种简单场景下，最大化配送数量的问题也是强NP难问题。我们提出了该问题的一个2-近似算法，并针对一个非平凡的实例族给出了最优算法。