kei18 / pibt2 Goto Github PK

• Replacing all -march=native with -mcpu=apple-m1 seems sufficient.
• Further investigation is required for the visualizer

Hello sir
sorry to bother you again
In your pypibt, you used bfs to generate distable
First question is:
I wonder if you still using it in the C++ pibt2
when i check solver.cpp, you are using bfsto generate distable too.
but when i run my reproduction code(which is confirmed no problem) in python, it is very slow in generating distable part when i use ost003d.map this kinds of big size map in (mapf benchmark){https://movingai.com/benchmarks/mapf/index.html} it's fast in searching process still, the other parts is ok. about 40ms averagely

and my second question is based on first.
if you are not using bfs, what did you use.
if you still using bfs , is the slow generating process just the difference between python and C++, or you have the same problem, but it doeson't counted on runtime for it is not part of searching process.

Thank you so much if you could respond to me!
and thanks again! for your earlier kind answer.