×

Approximate geodesic calculation based on an ant colony iterative algorithm. (Chinese. English summary) Zbl 1340.68133

Summary: 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.

MSC:

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W25 Approximation algorithms
PDFBibTeX XMLCite
Full Text: DOI