MultiAgentPathFinding

This package provides a toolbox for defining and solving multi-agent pathfinding problems in the Julia programming language.

Getting started

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.

Background

MultiAgentPathFinding.jl contains basic optimization algorithms related to multi-agent pathfinding, as well as a parser for the standard benchmark instances and solutions described in

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

Tracking Progress in Multi-Agent Path Finding, Shen et al. (2023)

If you use this package, please cite the following PhD dissertation:

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

Related projects

Alternative solvers:

• Shushman/MultiAgentPathFinding.jl: conflict-based search