arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.15950cs.DM
收藏

参数化算法用于协调运动规划:最小化能量

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy

Department of Computer Science, Royal Holloway, University of London(伦敦大学皇家霍洛威学院计算机科学系);Algorithms and Complexity Group, TU Wien(维也纳工业大学算法与复杂性组);School of Computing, DePaul University(德保罗大学计算机学院);Department of Computer Science, University of Warwick(华威大学计算机科学系)

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan

AI总结:

本文提出参数化算法解决协调运动规划问题,通过最小化能量,证明了在特定参数下的可处理性。

摘要:

我们研究了图上协调运动规划问题的一个推广的参数化复杂性,目标是将给定的k个机器人中的指定子集路由到其目的地,目的是最小化总能量(即总行驶长度)。我们开发了新的技术,以突破之前已建立的结果,这些结果仅限于实心网格。我们为该问题设计了一个固定参数加性近似算法,该算法仅参数化为k。这一结果,具有独立兴趣,使我们能够证明以下两个结果,与已研究的协调运动规划问题有关:(1)一个固定参数算法,参数化为k,用于将单个机器人路由到其目的地,同时避开其他机器人,这与著名的Rush-Hour谜题有关;(2)一个固定参数算法,参数化为k加上输入图的树宽,用于标准的协调运动规划(CMP)问题,其中需要将所有k个机器人路由到其目的地。后者结果意味着,例如,在树宽有界的图上,CMP参数化为k的固定参数可处理性。我们补充上述结果,一个下界排除了当参数化为总能量时CMP的固定参数可处理性。这与最近在实心网格下相同参数化下的可处理性形成对比。作为最终结果,我们加强了上述固定参数可处理性,不仅适用于实心网格,还适用于所有树宽有界的图——这一类包括其他如树宽有界的图。

英文摘要:

We study the parameterized complexity of a generalization of the coordinated motion planning problem on graphs, where the goal is to route a specified subset of a given set of $k$ robots to their destinations with the aim of minimizing the total energy (i.e., the total length traveled). We develop novel techniques to push beyond previously-established results that were restricted to solid grids. We design a fixed-parameter additive approximation algorithm for this problem parameterized by $k$ alone. This result, which is of independent interest, allows us to prove the following two results pertaining to well-studied coordinated motion planning problems: (1) A fixed-parameter algorithm, parameterized by $k$, for routing a single robot to its destination while avoiding the other robots, which is related to the famous Rush-Hour Puzzle; and (2) a fixed-parameter algorithm, parameterized by $k$ plus the treewidth of the input graph, for the standard \textsc{Coordinated Motion Planning} (CMP) problem in which we need to route all the $k$ robots to their destinations. The latter of these results implies, among others, the fixed-parameter tractability of CMP parameterized by $k$ on graphs of bounded outerplanarity, which include bounded-height subgrids. We complement the above results with a lower bound which rules out the fixed-parameter tractability for CMP when parameterized by the total energy. This contrasts the recently-obtained tractability of the problem on solid grids under the same parameterization. As our final result, we strengthen the aforementioned fixed-parameter tractability to hold not only on solid grids but all graphs of bounded local treewidth -- a class including, among others, all graphs of bounded genus.

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

↑