Symbolic and geometric connectivity graph methods for route planning in digitized maps
- 1 May 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 14 (5) , 549-565
- https://doi.org/10.1109/34.134059
Abstract
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.Keywords
This publication has 25 references indexed in Scilit:
- Symbolic expressions within a spatial algebra: unification and impact upon spatial reasoningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Visual reply to map-related queriesJournal of Visual Languages & Computing, 1991
- Algorithmic motion planning in roboticsComputer, 1989
- Heuristic Traversal Of A Free Space GraphPublished by SPIE-Intl Soc Optical Eng ,1989
- Planning Paths Through A Spatial Hierarchy: Eliminating Stair-Stepping EffectsPublished by SPIE-Intl Soc Optical Eng ,1989
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple PolygonSIAM Journal on Computing, 1988
- Automatic Operation For A Robot Lawn MowerPublished by SPIE-Intl Soc Optical Eng ,1987
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- Computational GeometryPublished by Springer Nature ,1985
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984