Testing performance of my global planner

edit

Hi

I implemented my own global planner algorithm as a c++ program. To measure its performance, I implemented A* in c++ also.

When I compare them, I found that my algorithm is faster than A* and generates the same path length as A*.

I wrote my algorithm as ROS global planner plugin, and I can move a robot using it.

However, in ROS, when I compare my planner and navfn (A* based) I found that my algorithm is slower than navfn and produces longer paths.

why there is a difference between A* c++ implementation and navfn (A* version)?

Thanks,