arXiv (OAI Expanded)open access
Goal Staying Makes Sum-of-Costs Anonymous Multi-Agent Path Finding NP-Hard
multiagent systems, computational complexity, robotics
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 788904
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.