Document is current

Any future updates will be listed below

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

Crossref DOI link: https://doi.org/10.1007/s00500-015-1750-1

Published Online: 2015-07-23

Published Print: 2016-10

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark