Open Source
Asymmetric Decomposition for Multi-Agent Path Finding with Unassigned Agents
arXiv cs.MA0 views
arXiv:2611.24108v1 Announce Type: cross Abstract: Robots without assigned tasks may obstruct active robots, while routing them to designated parking locations can cause unnecessary travel. This article proposes flow-oracle conflict-based search (FOCBS) for Multi-Agent Path Finding with unassigned agents (MAPF-UA). FOCBS searches over assigned-agent paths using conflict-based search (CBS) and routes targetless unassigned agents through a min-cost flow oracle. When the selected assigned-agent paths leave unassigned agents no collision-free paths, flow-conflict branching converts min-cut blockers into assigned-agent constraints, which guide the search without excluding optimal solutions. A batched zero-cost warm start accelerates the oracle, and start-avoiding tie-breaking reduces unassigned-agent movement. For feasible instances on finite graphs, we prove termination and global minimization of assigned-agent sum of service time, measured by last-arrival times. Unassigned-agent movement is minimized conditional on the selected assigned-agent paths, without a global lexicographic optimality guarantee. Benchmark experiments show that FOCBS scales well with the number of unassigned agents, and ablation studies show that, compared with discarding non-completable assigned-agent paths, flow-conflict branching solves substantially more instances while retaining optimality. Simulation and physical-robot experiments demonstrate plan executability, with laboratory tests reducing fleet travel by 40.8% relative to the parking-based coordination baseline. The source code and related resources are available at https://github.com/Chin-hsi/focbs
Source:https://arxiv.org/abs/2611.24108PreviousSCAFFOLD: Toward Warrant-Preserving Evidence Transport for Reusable LLM-Agent SkillsNextOpenKAGE: Open-Ended Lifelong Learning in the Open World via Knowledge-Sharing Agent-Group Evolution
Related posts
UPDF 3.0: One PDF Workflow from OCR and Editing to eSign
0FOSS Bytes
Revenant XSpark Signs Pranav Venkatesh as Its First Chess Player for Google Play Arena
0FOSS Bytes
The 1 MB problem: what 2,023 real PDFs say about file size in 2026
0dev.to UX
umux v1.8.1 through v1.8.6: software that stopped pretending
0dev.to Productivity
Tests that prove something: break a copy and see the test fail
0dev.to Testing

Independent Deployability Has Two Halves. Most Teams Built One.
0dev.to Kubernetes