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

滑动机器人协调运动规划的小型测试方法

A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots

Eduard Eiben, Robert Ganian, Iyad Kanj, Ramanujan M. Sridharan

AI总结:

本文研究滑动机器人协调运动规划(CSMP)问题,提出以机器人数量或完工时间为参数的固定参数算法,关键创新在于利用标记拓扑子式简洁表示解。

摘要:

我们研究了无向图上协调运动规划问题的一个变体,本文称之为协调滑动运动规划(CSMP)问题。在该变体中,给定一个无向图 $G$,$k$ 个机器人 $R_1,\dots,R_k$ 位于 $G$ 的不同顶点上,$p\leq k$ 个不同的目标顶点分别对应机器人 $R_1,\dots,R_p$,以及 $\ell \in \mathbb{N}$。问题在于判断是否存在一个至多 $\ell$ 步的串行调度(即完工时间为 $\ell$),使得调度结束时每个有目标的机器人都到达其目标,其中机器人的一步移动是从其当前位置到某个未被占据的顶点的自由路径(即路径上无其他机器人)。该问题即使在完整网格上也是 NP 困难的。它已在多种背景下被研究,包括硬币移动和重构问题,涉及可行性、复杂性和近似性。该问题的几何变体,即全等几何形状机器人(如单位圆盘/正方形)在欧几里得平面上滑动或平移,也被广泛研究。我们研究了 CSMP 关于两个参数的参数化复杂性:机器人数量 $k$ 和完工时间 $\ell$。作为我们的第一个结果,我们提出了一个以 $k$ 为参数的 CSMP 的固定参数算法。对于第二个结果,我们针对 CSMP 的一个特殊情况提出了以 $\ell$ 为参数的固定参数算法,该特殊情况中只有一个机器人有目标且图是平面的,我们证明了该特殊情况是 NP 完全的。我们两个结果的一个关键新要素是:解允许作为输入图的一个小的标记拓扑子式进行简洁表示。

英文摘要:

We study a variant of the Coordinated Motion Planning problem on undirected graphs, referred to herein as the \textsc{Coordinated Sliding-Motion Planning} (CSMP) problem. In this variant, we are given an undirected graph $G$, $k$ robots $R_1,\dots,R_k$ positioned on distinct vertices of $G$, $p\leq k$ distinct destination vertices for robots $R_1,\dots,R_p$, and $\ell \in \mathbb{N}$. The problem is to decide if there is a serial schedule of at most $\ell$ moves (i.e., of makespan $\ell$) such that at the end of the schedule each robot with a destination reaches it, where a robot's move is a free path (unoccupied by any robots) from its current position to an unoccupied vertex. The problem is known to be NP-hard even on full grids. It has been studied in several contexts, including coin movement and reconfiguration problems, with respect to feasibility, complexity, and approximation. Geometric variants of the problem, in which congruent geometric-shape robots (e.g., unit disk/squares) slide or translate in the Euclidean plane, have also been studied extensively. We investigate the parameterized complexity of CSMP with respect to two parameters: the number $k$ of robots and the makespan $\ell$. As our first result, we present a fixed-parameter algorithm for CSMP parameterized by $k$. For our second result, we present a fixed-parameter algorithm parameterized by $\ell$ for the special case of CSMP in which only a single robot has a destination and the graph is planar, which we prove to be NP-complete. A crucial new ingredient for both of our results is that the solution admits a succinct representation as a small labeled topological minor of the input graph.

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

↑