Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
Jiaoyang-Li authored May 9, 2024
1 parent 3e03f6e commit d70ccbe
Showing 1 changed file with 2 additions and 0 deletions.
2 changes: 2 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -8,6 +8,8 @@ Anytime Multi-Agent Path Finding via Large Neighborhood Search
MAPF-LNS is an effifent anytime algorithm for solving Multi-Agent Path Finding (MAPF).
More details can be found in our paper at IJCAI 2021 [1].

Note: The code used in the IJCAI paper had a typo for the agent-based neighborhood selection method. After fixing this typo (commit 3e03f6e), the method performs better than what was reported in the paper.

A stronger version MAPF-LNS2 can be found here: https://github.com/Jiaoyang-Li/MAPF-LNS2

The code requires the external libraries
Expand Down

0 comments on commit d70ccbe

Please sign in to comment.