"An Empirical Comparison of the Hardness of Multi-Agent Path Finding under ..."

Pavel Surynek et al. (2016)

> Home

Details and statistics

DOI: 10.1609/SOCS.V7I1.18407

access: open

type: Conference or Workshop Paper

metadata version: 2023-12-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/socs/SurynekFSB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/socs/SurynekFSB16
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. SOCS 2016: 145-146

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.