"Classifying the multi robot path finding problem into a quadratic ..."

Shahar Sarid, Amir Shapiro (2008)

> Home

Details and statistics

DOI: 10.1007/S10472-009-9122-0

access: closed

type: Journal Article

metadata version: 2018-11-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amai/SaridS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/SaridS08
Shahar Sarid, Amir Shapiro:
Classifying the multi robot path finding problem into a quadratic competitive complexity class. Ann. Math. Artif. Intell. 52(2-4): 169-203 (2008)

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.