Jiaoyang-Li / MAPF-LNS

Anytime Multi-Agent Path Finding via Large-Neighborhood Search
Other
53 stars 15 forks source link

Code questions #1

Open RigCor7 opened 10 months ago

RigCor7 commented 10 months ago

Firstly, thank you very much for your code, which is very helpful for me to learn MAPF.

But I'm not sure whether this line of code should be a=n, to select an agent in neighbors_set randomly. Otherwise, this is just a random selection [0, neighbors_set.size ()] agent, maybe randomly to other agents with no clear relationship with the max_delay agent.

Thanks a lot!