An algorithm with improved complexity for pebble motion/multi-agent path finding on trees

Documenti analoghi

• Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms
  di: Ardizzoni, Stefano, et al.
  Pubblicazione: (2022)
• Dynamic Programming based Local Search approaches for Multi-Agent Path Finding problems on Directed Graphs
  di: Saccani, Irene, et al.
  Pubblicazione: (2024)
• Constrained Multi-Agent Path Finding on Directed Graphs
  di: Ardizzoni, Stefano, et al.
  Pubblicazione: (2022)
• A Dynamic Programming Approach for Road Traffic Estimation
  di: Laurini, Mattia, et al.
  Pubblicazione: (2024)
• The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
  di: Ardizzoni, Stefano, et al.
  Pubblicazione: (2021)