大连理工大学学报
大連理工大學學報
대련리공대학학보
JOURNAL OF DALIAN UNIVERSITY OF TECHNOLOGY
2015年
1期
115-118
,共4页
测地线%迭代%加密%自适应
測地線%迭代%加密%自適應
측지선%질대%가밀%자괄응
geodesic%iteration%subdivide%self-adaption
为了提高两点之间近似测地线的计算精确度,提出一种蚁群迭代算法。在此算法中,对于任意一个地形,首先建立其垂直映射平面图,在平面图上进行初步网格划分,并用蚁群算法求出一条最短路径;再对网格不断进行加密划分,每一次加密处理网格之后都用蚁群算法计算精确度更高的最短路径,以此优化加密前求出的路径。该算法可有效避免待求两点之间图形解析式的困扰,并且采用自适应的方式寻找适当的网格规模,提高近似测地线的精确度。实验结果表明该算法在近似测地线的计算中是有效的。
為瞭提高兩點之間近似測地線的計算精確度,提齣一種蟻群迭代算法。在此算法中,對于任意一箇地形,首先建立其垂直映射平麵圖,在平麵圖上進行初步網格劃分,併用蟻群算法求齣一條最短路徑;再對網格不斷進行加密劃分,每一次加密處理網格之後都用蟻群算法計算精確度更高的最短路徑,以此優化加密前求齣的路徑。該算法可有效避免待求兩點之間圖形解析式的睏擾,併且採用自適應的方式尋找適噹的網格規模,提高近似測地線的精確度。實驗結果錶明該算法在近似測地線的計算中是有效的。
위료제고량점지간근사측지선적계산정학도,제출일충의군질대산법。재차산법중,대우임의일개지형,수선건립기수직영사평면도,재평면도상진행초보망격화분,병용의군산법구출일조최단로경;재대망격불단진행가밀화분,매일차가밀처리망격지후도용의군산법계산정학도경고적최단로경,이차우화가밀전구출적로경。해산법가유효피면대구량점지간도형해석식적곤우,병차채용자괄응적방식심조괄당적망격규모,제고근사측지선적정학도。실험결과표명해산법재근사측지선적계산중시유효적。
An ant colony iterative algorithm is proposed to enhance the calculation accuracy of the approximate geodesic between two points. In this algorithm, for any terrain, its corresponding vertical mapping planar graph is constructed firstly,and a preliminary grid partition is carried out on this planar graph,a shortest path is computed by using the ant colony algorithm based on this partition.Then,the grid is subdivided and a more accurate shortest path is computed to optimize the previous path before subdivided.This algorithm avoids the trouble of finding the terrain formula. Moreover,the best grid partition can be determined in a self-adaptive way, which significantly improves the accuracy of the approximate geodesic.This algorithm is shown to be effective by a few experiments.