An exact method for finding shortest routes on a sphere, avoiding obstacles

Abstract

On the surface of a sphere, we take as inputs two points, neither of them contained in any of a number of spherical polygon obstacles, and quickly find the shortest route connecting these two points while avoiding any obstacle. The WetRoute method presented here has been adopted by the US Navy for several applications. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 374–385, 2016

Document Details

Document Type
Pub Defense Publication
Publication Date
Aug 01, 2016
Source ID
10.1002/nav.21702

Entities

People

  • Alan R. Washburn
  • Gerald G. Jerry Brown

Organizations

  • Naval Postgraduate School
  • Office of Naval Research

Tags

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Graph Algorithms and Convex Optimization.
  • Logistics and Supply Chain Management.