A Julia package for modeling and solving precedence constrained multi-agent task assignment and path finding (PC-TAPF) problems.
Enter the Julia REPL
$ juliaType "]" to enter Pkg mode
julia> ]Add the dependent repository GraphUtil with the command add https://github.com/sisl/GraphUtils.jl.git
pkg> add https://github.com/sisl/GraphUtils.jl.gitAdd the dependent repository CRCBS with the command add add https://github.com/sisl/CRCBS.jl.git
pkg> add add https://github.com/sisl/CRCBS.jl.gitAdd the repository with the command add https://github.com/sisl/TaskGraphs.jl.git
pkg> add https://github.com/sisl/TaskGraphs.jl.gitIf you wish to contribute to the package, use dev:
pkg> dev https://github.com/sisl/TaskGraphs.jl.gitjulia> using TaskGraphs
julia> solver = NBSSolver(); # initialize a solver
julia> prob = pctapf_problem_1(solver); # initialize the problem
julia> solution, cost = solve!(solver,prob); # solve it
julia> optimal_status(solver) # check the solution statusA short tutorial can be found: https://github.com/sisl/TaskGraphs.jl/blob/master/docs/TaskGraphTutorial.ipynb
Optimal Sequential Task Assignment and Path Finding for Multi Agent Robotic Assembly Planning, Kyle Brown, Oriana Peltzer, Martin Sehr, Mac Schwager, Mykel Kochenderfer, in International Conference on Robotics and Automation (ICRA), 2020 arXiv