Skip to content

Latest commit

 

History

History
34 lines (22 loc) · 860 Bytes

README.md

File metadata and controls

34 lines (22 loc) · 860 Bytes

Description

This repository contains all the codes related to the research work ->

"An Adaptive Agent-Specific Sub-Optimal Bounding Approach for Multi-Agent Path Finding"

Requirement

The latest implementation relies on boost.

Usage

At first, you must prepare param file.

To confirm details, see a sample file.

Then you cancompile execute the simulator by the following commands in terminal:

make c
make crun param=sample-param.txt

Licence

This software is released under the MIT License, see a licence file.

Author

Mustafizur Rahman

Ahasanul Alam

Special thanks

Keisuke Okumura

Demo

Video