AI 中文总结
本文针对大智能体的多智能体路径寻路（LA-MAPF）问题，通过多项式时间归约从受限滑动令牌证明其为PSPACE完全，强化了该问题为NP难的已有结论。
AI 中文摘要
大智能体的多智能体路径寻路（LA-MAPF）是多智能体路径寻路（MAPF）的几何变体，其中智能体被建模为圆盘，冲突由基础欧几里得工作空间中的物理重叠决定。LA-MAPF的目标是判断是否存在从起始构型到目标构型的无冲突转换序列。Agafonov和Yakovlev已证明LA-MAPF是NP难的，本文通过从受限滑动令牌（Restricted Sliding Tokens）进行多项式时间归约，进一步证明LA-MAPF是PSPACE完全的。
英文摘要
Multi-Agent Path Finding for Large Agents (LA-MAPF) is a geometric variant of MAPF in which agents are modeled as disks and conflicts are determined by physical overlap in the underlying Euclidean workspace. The goal of LA-MAPF is to decide whether there exists a sequence of conflict-free transitions from a start configuration to a goal configuration. Agafonov and Yakovlev proved that LA-MAPF is NP-hard. In this paper, we strengthen their result by proving that LA-MAPF is PSPACE-complete via a polynomial-time reduction from Restricted Sliding Tokens.
