A new algorithm is presented to compute the shortest path on a graph when the node transition costs depend on the prior history of the path to the current node. The algorithm is applied to solve path planning problems with curvature constraints.
No takes yet. Share an insight, caveat, or question.
Cowlagi et al. (2009) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: