An Empirical Evaluation of Grid-based Path Planning Algorithms on Widely Used in Robotics Raspberry Pi Platform

We compare three widely used path planning algorithms, A*, Jump Point Search, Theta*, in terms of runtime performance on a desktop personal computer and on the Raspberry Pi 2 embedded computer widely used in robotics. We also evaluate the performance of recently introduced path planning algorithm, LIAN, on both computers. Two principal questions are targeted: first) to what extent modern embedded computers are slower than conventional desktops when solving path finding problems (the answer is - one order of magnitude); second) how well the former scale up to larger problems (the answer is - in the same way as desktop PCs).