Distance- and curvature-constrained shortest paths and an application in mission planning

André Berger, Nader Razouk, Greg Angelides
2006 Proceedings of the 44th annual southeast regional conference on - ACM-SE 44  
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.
doi:10.1145/1185448.1185626 dblp:conf/ACMse/BergerRA06 fatcat:rzkoege4nbdmhjmufebqt6tpbe