The pebble motion problem (PMP) asks whether one configuration of labeled pebbles on a graph can be transformed into another by moving pebbles to adjacent unoccupied vertices. It is a fundamental model of graph reconfiguration and is closely related to multi-agent path finding (MAPF). A central open problem since Kornhauser, Miller, and Spirakis (FOCS 1984) is to understand the origin of the classical $Θ(N^3)$ worst-case behavior. While it is known that every feasible instance on an $N$-vertex graph admits a solution sequence of length $\Ord(N^3)$, it has remained unclear which instances actually require cubic complexity. In this paper, we resolve the long-standing complexity of the pebble motion problem on trees. We show that every feasible instance on an $N$-vertex tree admits a solution sequence of length $\Ord(N^2 \log N)$, computable by an output-sensitive algorithm. Since a lower bound of $Ω(N^2)$ is known, this establishes that the $Θ(N^3)$ phenomenon does not occur on trees and nearly closes the gap $Ω(N^2)\le \OPT(N)\le \Ord(N^3)$ up to a logarithmic factor. Building on this result, we extend our approach to general graphs by applying the tree algorithm to breadth-first spanning trees. This yields an efficient framework that produces $o(N^3)$-length solution sequences for a broad class of instances, including the classical square-grid example, where we recover the $\Ord(N^{3/2})$ bound observed by Kornhauser, Miller, and Spirakis. Finally, by analyzing the behavior of this algorithm, we obtain strong structural restrictions governing when $Θ(N^3)$ complexity can arise. We show that such behavior is possible only under highly constrained conditions, specifically when $Θ(N)$ degree-two vertices lie on cycles of length $Θ(N)$, with each cycle being the shortest containing the corresponding vertex.

翻译：卵石运动问题（PMP）询问图上一组带标签卵石的配置能否通过将卵石移至相邻空顶点来转换为另一配置。这是图重构的基本模型，与多智能体路径规划（MAPF）密切相关。自Kornhauser、Miller和Spirakis（FOCS 1984）以来，一个核心开放问题是理解经典的$Θ(N^3)$最坏情况行为的起源。尽管已知每个在$N$个顶点图上的可行实例均存在长度为$\Ord(N^3)$的解序列，但哪些实例实际需要立方复杂性仍不清楚。本文解决了树上卵石运动问题的长期复杂性难题。我们证明，每个在$N$个顶点树上的可行实例均存在长度为$\Ord(N^2 \log N)$的解序列，且该序列可通过输出敏感算法计算得出。鉴于已知下界为$Ω(N^2)$，这表明$Θ(N^3)$现象在树上不会出现，并几乎闭合了$Ω(N^2)\le \OPT(N)\le \Ord(N^3)$的间隙（相差至多一个对数因子）。基于此结果，我们通过将树算法应用于广度优先生成树，将方法扩展至一般图。这一高效框架可为广泛类别的实例产生$o(N^3)$长度的解序列，包括经典方格网格实例——在该实例上我们恢复了Kornhauser、Miller和Spirakis观测到的$\Ord(N^{3/2})$界。最后，通过分析该算法的行为，我们获得了制约$Θ(N^3)$复杂性产生的强结构条件。我们证明，此类行为仅可能在高度受限条件下出现，具体而言，需满足$Θ(N)$个二度顶点位于长度为$Θ(N)$的环上，且每个环是包含对应顶点的最短环。