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

Authors:
André Berger;Nader Razouk;Greg Angelides
Affiliations:
Emory University, Atlanta, GA;Emory University, Atlanta, GA;MIT Lincoln Laboratory, Lexington, MA
Venue:
Proceedings of the 44th annual Southeast regional conference
Year:
2006

Citing 2
Cited 0

Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Curvature-Constrained Shortest Paths in a Convex Polygon

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.