Skip to content

Forked version of the original MAPF-PC repository to be used for Efficient LTL + MAPF Planning.

License

Notifications You must be signed in to change notification settings

aria-systems-group/MAPF-PC

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

MAPF with Precedence Constraints

This repo contains the implementations of CBS-PC and PBS-PC in our MAPF with Precedence Constraints paper. Please refer to the paper for more details about the problem formulation and algorithm details.

To begin with, you can compile the project using the following commands

cmake .
make

, and Cmake will generate three executables in the bin folder. They are:

  1. cbs runs the CBS-PC algorithm.
  2. pbs runs the PBS-PC algorithm.
  3. task_assignment assigns tasks first and then run a MAPF-PC algorithm. This is the one we used in the experiments.

For each executables, you can type --help to see the expected input arguments it. You can find example in run_exp.sh. The input_sample folder contains sample input files.

About

Forked version of the original MAPF-PC repository to be used for Efficient LTL + MAPF Planning.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 99.0%
  • Other 1.0%