David Eppstein - Publications

• Well-separated multiagent path traversal.
  G. Dilman, D. Eppstein, V. Polishchuk, and C. Schmidt.
  Proc. 36th Canadian Conference on Computational Geometry, 2024, pp. 137–144.

  We find algorithms and lower bounds for scheduling a sequence of release times for robots to follow the same path as each other, traversing the path at uniform speeds, and not colliding.

Co-authors – Publications – David Eppstein – Theory Group – Inf. & Comp. Sci. – UC Irvine

Semi-automatically filtered from a common source file.