"Relaxed Dijkstra and A* with linear complexity for robot path planning ..."

Adel Ammar et al. (2016)

> Home

Details and statistics

DOI: 10.1007/S00500-015-1750-1

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/soco/AmmarBCKA16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/AmmarBCKA16
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.