Efficient Grid Based Techniques for Solving the Weighted Region Least Cost Path Problem on Multicomputers
Abstract
This thesis explores the possibilities of developing fast grid-based parallel algorithms to solve the Weighted Region Least Cost Path problem. Two complementary steps have been undertaken. First, an efficient sequential algorithm to solve the above problem was developed. The algorithm is a modification of a Gauss-Seidellike algorithm for obtaining the minimum costs. The most salient feature of the algorithm is the reduction of the number of nodes and edges in cheaper regions of the grid. The reported experimental results ascertain the superiority of this algorithm with regard to computer running time at a modest reduction in the accuracy of the obtained solution. Parallel implementations of grid-based algorithms were studied. A simple grid- based variant was implemented on a network of Transputers. The overall approach employed could be used to develop a parallel version of the above sequential algorithm on a Transputer network, combining both advantages of efficiency and parallelism.... Numerical Path Planning, Weighted Regions, Grid Based Techniques, Transputers, Distributed Computing, Parallel Processing.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1992
- Accession Number
- ADA262153
Entities
People
- Cengiz Ekin
Organizations
- Naval Postgraduate School