论文信息 - Finding shortest paths in the plane in the presence of barriers to travel (for any lp - norm)

Finding shortest paths in the plane in the presence of barriers to travel (for any lp - norm)

Abstract This paper develops an efficient algorithm for the computation of the shortest paths between given sets of points (origins and destinations) in the plane, when these paths are constrained not to cross any of a finite set of polygonal (open or closed) barriers. It is proved that when distances are measured by an 1p - norm with 1 It is also shown that optimal solutions when distances are measured according to the rectilinear or max-norm (i.e. lp-norm with p = 1 or p = ∞) can be deduced from the results of the algorithm.

Pierre Hansen | José Manuel Viegas | P. Hansen | J. Viegas

[1] Margaret K. Schaefer,et al. Solutions of Constrained Location Problems , 1975 .

[2] Stephen M. Pollock,et al. MINIMUM-TRAJECTORY PIPE ROUTING , 1974 .

[3] Victor O. K. Li,et al. Finding minimum rectilinear distance paths in the presence of barriers , 1981, Networks.

[4] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .

[5] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[6] Pierre Hansen,et al. SOME LOCALIZATION THEOREMS FOR A CONSTRAINED WEBER PROBLEM , 1981 .

[7] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[8] L. Cooper,et al. Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle , 1981 .

[9] Richard C. Larson,et al. Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel , 1983, Oper. Res..

[10] Donald E. Kirk,et al. A Dual-Mode Routing Algorithm for an Autonomous Roving Vehicle , 1970, IEEE Transactions on Aerospace and Electronic Systems.

[11] Jacques-François Thisse,et al. An Algorithm for a Constrained Weber Problem , 1982 .