arXiv (All)
open access
Goal Staying Makes Sum-of-Costs Anonymous Multi-Agent Path Finding NP-Hard
Anonymous Multi-Agent Path Finding (AMAPF) admits polynomial-time network-flow algorithms for several objectives, including makespan, total distance, and sum-of-costs (SoC) when agents disappear upon reaching goals. We show that standard goal-staying AMAPF is fundamentally different. We first formul
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Goal Staying Makes Sum-of-Costs Anonymous Multi-Agent Path Finding NP-Hard#788904
- Optimal Non-Adaptive Vantage Point Selection#997165
- Cogentic: Multi-Agent Orchestration for Automated Proof Discovery#1154584
- Cogentic: Multi-Agent Orchestration for Automated Proof Discovery#1136858
- Convergence Analysis of Distributed Optimization: A Dissipativity Framework#1084072
Record · ID 792908
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive