"Refined Hardness of Distance-Optimal Multi-Agent Path Finding."

Tzvika Geft, Dan Halperin (2022)

> Home

Details and statistics

DOI: 10.5555/3535850.3535905

access: open

type: Conference or Workshop Paper

metadata version: 2022-07-18

- view
  - electronic edition @ ifaamas.org (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/atal/GeftH22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/atal/GeftH22
Tzvika Geft, Dan Halperin:
Refined Hardness of Distance-Optimal Multi-Agent Path Finding. AAMAS 2022: 481-488

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.