MultiAgentPathFinding

This package provides a toolbox for defining and solving Multi-Agent PathFinding problems in the Julia programming language.

For the latest stable version, open a Julia Pkg REPL and run

pkg> add MultiAgentPathFinding

For the development version, run

pkg> add https://github.com/gdalle/MultiAgentPathFinding.jl

For now the documentation is a bit lacking, but take a look at the files in test for usage examples.

MultiAgentPathFinding.jl contains some heuristic algorithms (cooperative A* and local search) described in the PhD thesis

Machine learning and combinatorial optimization algorithms, with applications to railway planning, Dalle (2022)

It also contains a parser for the set of benchmark instances introduced by

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks, Stern et al. (2019)

Alternative solvers:

• Shushman/MultiAgentPathFinding.jl: conflict-based search