Shortest distance problems in graphs using history-dependent transition costs with application to kinodynamic path planning

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.