Computing Optimum Routes Across Terrain Using Dap

Abstract

Dynamic programming techniques provide quantitative ways for determining optimum routes across complex terrain for various assumed categories of vehicle, taking account of gradients, the presence or absence of roads and obstacles such as rivers, urban areas, woods etc. We have investigated the effectiveness of a highly parallel SIMD computer. (Mil-DAP) to this problem. We conclude that, although impressive computation speeds can be obtained on high resolution digital maps with Mil-DAP, the conflict between exploiting high order SIMD parallelism and minimising the number of necessary computation operations is such that in this case Mil-DAP does not command a dominating advantage over a conventional uniprocessor. Great Britain. (rrh)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1989
Accession Number
ADA216297

Entities

People

  • C. Packer
  • J. B. Roberts
  • P. Simpson
  • R. Haynes

Organizations

  • Royal Signals and Radar Establishment

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Digital Maps
  • Dynamic Programming
  • Foreign Languages
  • High Resolution
  • Maps
  • Nodes
  • Optimization
  • Photographs
  • Terrain
  • Transitions
  • Travel Time
  • Urban Areas
  • Vehicles

Readers

  • Computer Vision.
  • Parallel and Distributed Computing.
  • Theoretical Analysis.