跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21277 · v1

Even Loose Proximity Constraints Make Makespan-optimal Unlabeled Multi-agent Pathfinding Hard

首次提交 2026-11-16 23:46
版本更新 2026-11-16 23:46
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

We study \textsc{rr-Connected Unlabeled Multi-agent Pathfinding} (rrCUMAPF), a variant of MAPF where interchangeable agents have a proximity range r∈Nr\in \mathbb{N}, and agents must form a single group in a given graph GG through limited-range communication at all times. The problem arises in fundamental applications such as self-reconfiguration and platooning, while standard MAPF does not capture proximity constraints. For the problem of finding a makespan-optimal solution, prior work shows \NP-hardness for r=1r=1 and polynomial-time solvability when rr is sufficiently large; the complexity for the intermediate case 2≤r2\le r is largely unknown. To narrow this gap, we show that finding a solution to rrCUMAPF with makespan at most 22 is \NP-hard for 2≤r=O(∣V∣1−ε)2\le r= O(|V|^{1-\varepsilon}), where 0<ε≤10<\varepsilon\le 1 is a fixed constant and ∣V∣|V| is the number of vertices. As a consequence, we show that the labeled analogue of rrCUMAPF is also \NP-hard under the same condition.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 23:46 · 最新观测版本

Even Loose Proximity Constraints Make Makespan-optimal Unlabeled Multi-agent Pathfinding Hard

We study \textsc{rr-Connected Unlabeled Multi-agent Pathfinding} (rrCUMAPF), a variant of MAPF where interchangeable agents have a proximity range r∈Nr\in \mathbb{N}, and agents must form a single group in a given graph GG through limited-range communication at all times. The problem arises in fundamental applications such as self-reconfiguration and platooning, while standard MAPF does not capture proximity constraints. For the problem of finding a makespan-optimal solution, prior work shows \NP-hardness for r=1r=1 and polynomial-time solvability when rr is sufficiently large; the complexity for the intermediate case 2≤r2\le r is largely unknown. To narrow this gap, we show that finding a solution to rrCUMAPF with makespan at most 22 is \NP-hard for 2≤r=O(∣V∣1−ε)2\le r= O(|V|^{1-\varepsilon}), where 0<ε≤10<\varepsilon\le 1 is a fixed constant and ∣V∣|V| is the number of vertices. As a consequence, we show that the labeled analogue of rrCUMAPF is also \NP-hard under the same condition.

查看此版本解读 →查看此版本原文 ↗