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]

Authors

Adel Ammar

This author has not been identified. Look up 'Adel Ammar' in Google

Hachemi Bennaceur

This author has not been identified. Look up 'Hachemi Bennaceur' in Google

Imen Châari

This author has not been identified. Look up 'Imen Châari' in Google

Anis Koubâa

This author has not been identified. Look up 'Anis Koubâa' in Google

Maram Alajlan

This author has not been identified. Look up 'Maram Alajlan' in Google