"Inapproximability of Optimal Multi-Agent Pathfinding Problems."

Xing Tan, Alban Grastien (2025)

> Home

Details and statistics

DOI: 10.1609/AAAI.V39I25.34873

access: open

type: Conference or Workshop Paper

metadata version: 2025-04-22

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/aaai/TanG25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/TanG25
Xing Tan, Alban Grastien:
Inapproximability of Optimal Multi-Agent Pathfinding Problems. AAAI 2025: 26707-26715

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.