• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Efficient Grid Based Techniques for Solving the Weighted Region Least Cost PathProblem on Multicomputers
【24h】

Efficient Grid Based Techniques for Solving the Weighted Region Least Cost PathProblem on Multicomputers

机译：基于高效网格的多机解决加权区域最小成本路径问题的技术

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This thesis explores the possibilities of developing fast grid-based parallelalgorithms 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.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号