Skip to content
This repository has been archived by the owner on Jul 25, 2023. It is now read-only.
/ pibt Public archive

Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)

License

Notifications You must be signed in to change notification settings

Kei18/pibt

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

PIBT

Let multiple agents move smoothly. See the project page.

IMPORTANT NOTES

  • In v1.0-v1.2, the PPS implementation includes bugs. Use the latest (≥v1.3). You can check the PPS results here. The results are not so different from the PIBT paper.
  • A new version (pibt2), substantially updated for a journal paper, is out. I strongly recommend using the new one instead of this repo.

Demo

Multi-agent Path Finding

MAPF

Multi-agent Pickup and Delivery (sushi-mode)

MAPD

Requirement

The visualization relies on openFrameworks. You need to install openFrameworks beforehand and export OF_ROOT of your environment.

export OF_ROOT={your openFrameworks directory}

The latest implementation relies on boost.

Usage

At first, you must prepare param file. To confirm details, see a sample file. Then you can execute the simulator as following.

  • implementation with openFrameworks
make of
make ofrun param=sample-param.txt
  • without visualization (for experiment)
make c
make crun param=sample-param.txt

Licence

This software is released under the MIT License, see LICENSE.txt.

Others

Author

Keisuke Okumura is currently a Ph.D. candidate at Tokyo Institute of Technology, working on multiple moving agents.

About

Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)

Resources

License

Stars

Watchers

Forks

Packages

No packages published