Distance- and curvature-constrained shortest paths and an application in mission planning
André Berger, Nader Razouk, Gregory Angelides · 2006
We consider a generalization of the constrained shortest path problem, in which we forbid certain pairs of edges to appear consecutively on a feasible path. This problem has applications in robotics and optimal mission planning. We propose a dynamical programming heuristic for this problem and show computational results for an application in routing an aircraft through hostile space.