jiaoyang-li / cbsh2 Goto Github PK

Hello,
I'm very interested in MAPF. I want to ask you, how does this code run on the Windows platform?

Dear author, is the code able to output the trajectory for each agent given the map and agents' info?

First of all, thank you for your outstanding work
vector<vector*> paths;
What form is the output path of each agent stored in the paths variable?
struct PathEntry
{
int location;
bool single;
PathEntry(int loc = -1) { location = loc; single = false; }
};
Is the location variable in struct pathEntry the agent path coordinates?
Looking forward to your reply

Dear author,I tried to connected small agents to large agent and modify the algorithms but it seems can't work in most situations. I've read the paper Multi-Agent Path Finding for Large Agents but powerless to recurrent it, can you give me some advice?

Can you describe the meanings of the values stored at the test.csv output file?

How can we run/change the code for the MAPF problem which agents "disappear at target"?

I did not understand, if I'm doing something wrong or the code need to be executed on linux platform. Everytime I tried to run it, it gives an error that says my platform is windows.