基于蚁群迭代算法的近似测地线计算  

Approximate geodesic calculation based on ant colony iterative algorithm

作　　者：龚燕[1] 杨洁[1] 吴微[1] 

机构地区：[1]大连理工大学数学科学学院,辽宁大连116024

出　　处：《大连理工大学学报》2015年第1期115-118,共4页Journal of Dalian University of Technology

基　　金：国家自然科学基金资助项目(61473059;11171367;11201051;2662013BQ049;2662014QC011);中央高校基本科研业务费专项资金资助项目(DUT13LK46)

摘　　要：为了提高两点之间近似测地线的计算精确度,提出一种蚁群迭代算法.在此算法中,对于任意一个地形,首先建立其垂直映射平面图,在平面图上进行初步网格划分,并用蚁群算法求出一条最短路径;再对网格不断进行加密划分,每一次加密处理网格之后都用蚁群算法计算精确度更高的最短路径,以此优化加密前求出的路径.该算法可有效避免待求两点之间图形解析式的困扰,并且采用自适应的方式寻找适当的网格规模,提高近似测地线的精确度.实验结果表明该算法在近似测地线的计算中是有效的.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.

关 键 词：测地线 迭代 加密 自适应 

分 类 号：O29[理学—应用数学]