由节能代理商集体快速交付
Collective fast delivery by energy-efficient agents
摘要:
我们考虑k个移动代理最初位于无向图的不同节点(在n个节点上,具有边长度),这些节点必须从给定的源节点s向给定的目标节点t提供单个项目。代理可以沿着图的边缘移动,从时间0开始,关于以下内容:每个代理i具有定义在图中行进一段距离时的能量消耗速率的权重w_i,以及它可以移动的速度v_i。我们感兴趣的时间表(操作k个代理),导致小的交付时间T(包裹到达t的时间)和小的总能耗E。具体地说,我们要求一个时间表:(i)最小化T,(ii)最小化字典(T,E)(优先考虑快速交付),或(iii)最小化T *T +(1-T)*E,对于给定的T,0<T <1。证明了(i)在多项式时间内可解,(ii)在路径上对均匀速度是多项式时间可解的,对任意速度在时间O(n + klog k)内可解,但一般情况下即使在平面图上也是NP-困难的.作为我们的硬度结果的推论,(iii)也是NP-难的。我们表明,有一个3-近似算法(iii)使用一个单一的代理。
英文摘要:
We consider k mobile agents initially located at distinct nodes of an undirected graph (on n nodes, with edge lengths) that have to deliver a single item from a given source node s to a given target node t. The agents can move along the edges of the graph, starting at time 0 with respect to the following: Each agent i has a weight w_i that defines the rate of energy consumption while travelling a distance in the graph, and a velocity v_i with which it can move. We are interested in schedules (operating the k agents) that result in a small delivery time T (time when the package arrives at t), and small total energy consumption E. Concretely, we ask for a schedule that: either (i) Minimizes T, (ii) Minimizes lexicographically (T,E) (prioritizing fast delivery), or (iii) Minimizes epsilon*T + (1-epsilon)*E, for a given epsilon, 0<epsilon<1. We show that (i) is solvable in polynomial time, and show that (ii) is polynomial-time solvable for uniform velocities and solvable in time O(n + k log k) for arbitrary velocities on paths, but in general is NP-hard even on planar graphs. As a corollary of our hardness result, (iii) is NP-hard, too. We show that there is a 3-approximation algorithm for (iii) using a single agent.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。