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]

@article{AmmarBCKA16,
  title = {Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments},
  author = {Adel Ammar and Hachemi Bennaceur and Imen Châari and Anis Koubâa and Maram Alajlan},
  year = {2016},
  doi = {10.1007/s00500-015-1750-1},
  url = {http://dx.doi.org/10.1007/s00500-015-1750-1},
  researchr = {https://researchr.org/publication/AmmarBCKA16},
  cites = {0},
  citedby = {0},
  journal = {Soft Comput.},
  volume = {20},
  number = {10},
  pages = {4149-4171},
}