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).

Authors
Publisher
ALIFE ROBOTICS CO, LTD
Language
English
Pages
383-386
Status
Published
Year
2018
Organizations
  • 1 Peoples Friendship Univ Russia RUDN Univ, Moscow, Russia
  • 2 Russian Acad Sci, Fed Res Ctr Comp Sci & Control, Moscow, Russia
Keywords
path finding; path planning; grid; A*; LIAN; Raspberry Pi
Date of creation
04.02.2019
Date of change
04.02.2019
Short link
https://repository.rudn.ru/en/records/article/record/36708/
Share

Other records