Skip to main content
Article thumbnail
Location of Repository

Path Planning on a Compressed Terrain

By Daniel M. Tracy, Franklin T. Luk, W. Randolph Franklin, Marcus Andrade and Barbara Cutler

Abstract

We present a better algorithm for path planning on complex terrain in the presence of observers and define several metrics related to path planning to evaluate the quality of various terrain compression strategies. The path-planning algorithm simulates a smugglers and border guards scenario. First, we place observers on a terrain so as to optimize their visible coverage area. Next, we compute a path that a smuggler would take to minimize detection by an observer, path length, and uphill movement. The smuggler is allowed the full range of Euclidean motion on the 2-dimensional plane, unlike alternate path planning schemes that strictly avoid obstacles. We use two runs of the A * algorithm to efficiently compute this path. We introduce new application-specific error metrics for evaluating lossy terrain compression. The target terrain applications are the optimal placement of observers on a landscape and the navigation through the terrain by smugglers. The error metrics compare the observer visibility and the cost of the optimal smuggler’s route on the reconstructed terrain to the original terrain

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.9212
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.rpi.edu/~cutler/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.