Path Planning in 0/1/∞ Weighted Regions with Applications

DOI10.1287/ijoc.2.3.253zbMath0755.90084OpenAlexW2122845873MaRDI QIDQ4025920

Alex C.-C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos, Laxmi P. Gewali

Publication date: 18 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2.3.253

zbMATH Keywords

polygonpath planningshortest pathsterrain navigation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (16)

Optimum placement of guards ⋮ Guarding galleries and terrains ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Optimum watchman routes ⋮ Path planning in a weighted planar subdivision under the Manhattan metric ⋮ Routing multi-class traffic flows in the plane ⋮ Link distance and shortest path problems in the plane ⋮ CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER ⋮ A survey of geodesic paths on 3D surfaces ⋮ Quickest path queries on transportation network ⋮ Maximum thick paths in static and dynamic environments ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Region-restricted clustering for geographic data mining ⋮ Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications ⋮ GUARDING ART GALLERIES BY GUARDING WITNESSES ⋮ Link Distance and Shortest Path Problems in the Plane

This page was built for publication: Path Planning in 0/1/∞ Weighted Regions with Applications