Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments

Adel Ammar, Hachemi Bennaceur, Imen Châari, Anis Koubâa, Maram Alajlan. Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments. Soft Comput., 20(10):4149-4171, 2016. [doi]

Abstract

Abstract is missing.