Issue No. 05 - May (1992 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.134059
<p>The results of research involving spatial reasoning within digitized maps are reported, focusing on techniques for 2D route planning in the presence of obstacles. Two alternative approaches to route planning are discussed, one involving heuristic symbolic processing and the other employing geometric calculations. Both techniques employ A* search over a connectivity graph. The geometric system produces a simple list of coordinate positions, whereas the symbolic system generates a symbolic description of the planned route. The symbolic system achieves this capability through the use of inference rules that can analyze and classify spatial relationships within the connectivity graph. The geometric method calculates an exact path from the connectivity information in the graph. Thus, the connectivity graph acts both as a knowledge structure on which spatial reasoning can be performed and as a data structure supporting geometrical calculations. An extension of the methodology that exploits a hierarchical data structure is described.</p>
symbolic connectivity; obstacle avoidance; geometric connectivity graph methods; route planning; digitized maps; spatial reasoning; 2D route planning; heuristic symbolic processing; A* search; inference rules; knowledge structure; hierarchical data structure; computational geometry; graph theory; heuristic programming; planning (artificial intelligence); search problems; spatial reasoning; symbol manipulation
E. Jungert and P. Holmes, "Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 14, no. , pp. 549-565, 1992.