AI & ML
Even Loose Proximity Constraints Make Makespan-optimal Unlabeled Multi-agent Pathfinding Hard
arXiv cs.MA0 views
arXiv:2611.21277v2 Announce Type: replace Abstract: We study $r$-Connected Unlabeled Multi-agent Pathfinding ($r$CUMAPF), a variant of MAPF where interchangeable agents have a proximity range $r\in \mathbb{N}$, and agents must form a single group in a given graph $G$ 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=1$ and polynomial-time solvability when $r$ is sufficiently large; the complexity for the intermediate case $2\le r$ is largely unknown. To narrow this gap, we show that finding a solution to $r$CUMAPF with makespan at most $2$ is NP-hard for $2\le r= O(|V|^{1-\varepsilon})$, where $0<\varepsilon\le 1$ is a fixed constant and $|V|$ is the number of vertices. As a consequence, we show that the labeled analogue of $r$CUMAPF is also NP-hard under the same condition.
Source:https://arxiv.org/abs/2611.21277PreviousEquilibrium decisions under partial observation: dynamical error bounds and information requirementsNextBuilding verifiable databases at scale from the chemical literature via a multi-agent system
Related posts

Do cybersecurity certifications raise pay? Postings that name one advertise 13.8% less (Nov 2026)
0dev.to Security
Ninety Days Became Thirty: What the Disclosure Deadline Collapse Actually Teaches
0dev.to Security

Make your voice count in the State of Observability & Reliability report
0dev.to DevOps
config init container for Nsigth Command
0dev.to Docker

Anthropic IPO is set to redraw VC power rankings, with lesser-known firms like Spark Capital poised for outsized returns compared with larger, blue-chip rivals (George Hammond/Financial Times)
0Techmeme

A Gallup survey of 15,925 people aged 15 to 22 across 16 countries finds that more than 33% rely on AI for companionship, rising to 50% among daily AI users (Jason Parham/Wired)
0Techmeme