能量受限的移动机器人协同配送
Collaborative Delivery with Energy-Constrained Mobile Robots
摘要:
我们考虑的问题,集体提供一些消息从一个指定的源到一个指定的目标位置在一个图中,使用多个移动代理。每个智能体都有一个有限的能量,限制了它可以移动的距离。因此,多个代理需要协作来移动消息,每个代理将消息移交给下一个代理以将其转发。给定代理在图中的位置及其各自的预算,为代理找到可行的移动计划的问题可能具有挑战性。我们考虑两个变种的问题:在不返回的交付,代理商可以停止任何地方,而在返回的交付,每个代理商需要返回到其起始位置,一个变量,这还没有被研究过。首先,我们提供了一个多项式时间算法返回交付的树木,这是在相反的非返回版本的已知(弱)NP-硬度。此外,我们还给出了一般图中的返回交付的资源增强算法。最后,我们给出了严格的下限所需的资源增加的两个变种的问题。从这个意义上说,我们的研究结果缩小了以前研究留下的差距。
英文摘要:
We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a limited energy which constrains the distance it can move. Hence multiple agents need to collaborate to move the message, each agent handing over the message to the next agent to carry it forward. Given the positions of the agents in the graph and their respective budgets, the problem of finding a feasible movement schedule for the agents can be challenging. We consider two variants of the problem: in non-returning delivery, the agents can stop anywhere; whereas in returning delivery, each agent needs to return to its starting location, a variant which has not been studied before. We first provide a polynomial-time algorithm for returning delivery on trees, which is in contrast to the known (weak) NP-hardness of the non-returning version. In addition, we give resource-augmented algorithms for returning delivery in general graphs. Finally, we give tight lower bounds on the required resource augmentation for both variants of the problem. In this sense, our results close the gap left by previous research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。