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

在线服务定时请求

Servicing Timed Requests on a Line

A. Gkikas, T. Radzik

摘要:

我们认为离线优化问题,$k$机器人必须在一个单一的行服务$n$请求。请求$i$具有权重$w_i$,并且在线路上的位置$d_i$处的时间$t_i$发生。如果机器人在时间$t_i$出现在$d_i$,则机器人可以服务请求并收集重量$w_i$。我们的目标是找到最大化总重量的$k$机器人时间表。优化问题是由机器人应用[Asahiro et al. Discrete Applied Mathematics,2006]激发的,并且可以被建模为流网络$\mathcal{N}$中具有单位容量的最小成本流问题。因此,我们要求收集的$k$节点不相交的路径从源$s$到汇$t$在$\mathcal{N}$,具有最小的总重量。在[Asahiro et al. Discrete Applied Mathematics,2006]中示出了流网络$\mathcal{N}$可以由平面上的$n$点隐式地表示,这产生了用于$k=1$的$O(n \log n)$ -时间算法和所有请求具有相同权重的特殊情况。然而,对于$k \geq 2$,可以用不使用这种隐式表示的连续最短路径算法在$O(kn^2)$时间内解决该问题。我们考虑任意请求的权重,并显示一个递归的$O(k^{2k}n \log^{2k} n)$时间算法,提高了以前的界限,如果$k$被认为是常数。我们的研究结果也提高了其他变种的优化问题的以前的算法的运行时间。最后,我们显示的问题属性,可能是有用的背景下的应用程序,激发问题,并可能产生更有效的算法。

英文摘要:

We consider an off-line optimisation problem where $k$ robots must service $n$ requests on a single line. A request $i$ has weight $w_i$ and takes place at time $t_i$ at location $d_i$ on the line. A robot can service a request and collect the weight $w_i$, if it is present at $d_i$ at time $t_i$. The objective is to find $k$ robot-schedules that maximize the total weight. The optimisation problem is motivated by a robotics application [Asahiro et al. Discrete Applied Mathematics, 2006] and can be modeled as a minimum cost flow problem with unit capacities in a flow network $\mathcal{N}$. Consequently, we ask for a collection of $k$ node-disjoint paths from the source $s$ to the sink $t$ in $\mathcal{N}$, with minimum total weight. It was shown in [Asahiro et al. Discrete Applied Mathematics, 2006] that the flow network $\mathcal{N}$ can be implicitly represented by $n$ points on the plane which yields to an $O(n \log n)$-time algorithm for $k=1$ and the special case where all requests have the same weight. However, for $k \geq 2$ the problem can be solved in $O(kn^2)$ time with the successive shortest path algorithm which does not use this implicit representation. We consider arbitrary request weights and show a recursive $O(k^{2k}n \log^{2k} n)$-time algorithm which improves the previous bound if $k$ is considered constant. Our result also improves the running time of previous algorithms for other variants of the optimisation problem. Finally, we show problem properties that may be useful within the context of applications that motivate the problem and may yield to more efficient algorithms.

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

↑