
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P.D. Holmes, E.R.A. Jungert, "Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, no. 5, pp. 549565, May, 1992.  
BibTex  x  
@article{ 10.1109/34.134059, author = {P.D. Holmes and E.R.A. Jungert}, title = {Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {14}, number = {5}, issn = {01628828}, year = {1992}, pages = {549565}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.134059}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps IS  5 SN  01628828 SP549 EP565 EPD  549565 A1  P.D. Holmes, A1  E.R.A. Jungert, PY  1992 KW  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 VL  14 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
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.
[1] J.F. Allen, "Maintaining Knowledge About Temporal Intervals,"Comm. ACM, Vol. 26, No. 11, Nov. 1983, pp. 832 843.
[2] S. K. Chang and E. Jungert, "A spatial knowledge structure for image information systems using symbolic projections," inVisual Languages and Applications(T. Ichikawa, E. Jungert, and R. R. Korfhage, Eds.). New York: Plenum, 1990, pp. 277303.
[3] S. K. Chang, Q. Y. Shi, and C. W. Yan, "Iconic indexing by 2D strings,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI9, no. 3, pp. 413428, May 1987.
[4] E. W. Dijkstra, "A note on two problems in connection with graphs,"Numerische Mathematik, vol. 1, pp. 269271, 1959.
[5] L. Dorst and P. W. Verbeek, "The constrained distance transformation: A pseudoEuclidean recursive implementation of the Leealgorithm," inSignal Processing III; Theories and Applications, (I. T. Younget al., Eds.). New York: Elsevier, 1986.
[6] A. Fournier and D. Y. Montuno, "Triangulating simple polygons and equivalent problems,"ACM Trans. Graphics, vol. 3, no. 2, pp. 153174, Apr. 1984.
[7] M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan, "Triangulating a simple polygon,"Inform. Processing Lett., vol. 7, no. 4, pp. 175179, June 1978.
[8] L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, "Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons,"Algorithmica 2, pp. 209233, 1987.
[9] S. Hertel and K. Mehlhorn, "Fast triangulation of simple polygons," inProc. 1983 Int. Conf. Foundations Comput. Sci.(Tucson AZ), Nov. 1983, pp. 207218.
[10] P. D. Holmes, "Visual reply to maprelated queriesA free space graph approach,"J. Visual Languages Comput., vol. 2, no. 2, pp. 143162, June 1991.
[11] P. D. Holmes and E. Jungert, "Shortest paths in a digitized map using a tilebased data structure," inProc. Third Int. Conf. Eng. Graphics Descriptive Geometry(Vienna, Austria), July 1988, pp. 238245, vol. 1.
[12] P. D. Holmes and E. Jungert, "Heuristic traversal of a free space graph," inSensor Fusion: Spatial Reasoning and Scene Interpretation, 1988, pp. 495503, SPIE vol. 1003.
[13] Y. Y. Huang, Z. L. Cao, S. J. Oh, E. U. Kattan, and E. L. Hall, "Automatic operation for a robot lawn mower," inMobile Robots, 1986, pp. 344354, SPIE vol. 727.
[14] E. Jungert, "Run length code as an objectoriented spatial data structure," inProc. IEEE Workshop Languages Automat.(Singapore), Aug. 1986, pp. 6670.
[15] E. Jungert, "Extended symbolic projections as a knowledge structure for spatial reasoning and planning," inPattern Recognition(J. Kittler, Ed.). New York: Springer Verlag, 1988.
[16] E. Jungert, "Symbolic expressions within a spatial algebra: Unification and impact upon spatial reasoning,"Proc. IEEE Workshop Visual Languages(Rome, Italy), Oct. 1989, pp. 157162.
[17] E. Jungert and S. K. Chang, "An algebra for symbolic image manipulation and transformation," inVisual Database Systems(T. L. Kunii, Ed.). Amsterdam: NorthHolland, 1989.
[18] E. Jungert and S. K. Chang, "An image algebra for pictorial data manipulation," to be published inComput. Vision Graphics Image Processing (CVGIP): Image Understanding.
[19] E. Jungert and P. D. Holmes, "A knowledgebased approach to the shortest path problem in a digitized map," inProc. IEEE Workshop Visual Languages(Pittsburgh, PA), Oct. 1988, pp. 248255.
[20] E. Jungert and P. Hampus, "A database structure for an objectoriented rasterbased geographical information system," inProc. 1st Euro. Conf. Geograph. Inform. Syst.(Amsterdam), Apr. 1013, 1990, pp. 526533.
[21] E. Jungert and P. D. Holmes, "A hierarchical knowledge structure for heuristic path planning," inProc. Second Int. Conf. Intell. Autonomous Syst.(Amsterdam), Dec. 1989, pp. 230240.
[22] S. Kambhampati and L. S. Davis, "Multiresolution path planning for mobile robots,"IEEE J. Robotics Automat., vol. RA2, no. 3, pp. 135145, Sept. 1986.
[23] D. T. Lee and F. P. Preparata, "Euclidean shortest paths in the presence of rectilinear barriers,"Networks, vol. 14, pp. 393410, 1984.
[24] T. LozanoPerez, "Automatic planning of manipulator transfer movements,"IEEE Trans. Syst. Man Cybern., vol. SMC11, no. 10, pp. 681698, Oct. 1981.
[25] A. C. C. Meng, "Reasoning about free space and motion planning problems," to be published inAdvances in Spatial Reasoning, ABLEX Inc.
[26] A. Meystel, A. Guez, and G. Hillel, "Minimum time path planning for a robot," inProc. IEEE 1986 Int. Conf. Robotics Automat., pp. 16781687, vol. 3.
[27] J. S. B. Mitchell, D. W. Payton, and D. M. Keirsey, "Planning and reasoning for autonomous vehicle control,"Int. J. Intell. Syst., vol. 2, pp. 129198, 1987.
[28] N. Nilsson,Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
[29] C. O'Dunlaing, M. Sharir, and C. Yap, "Generalized Voronoi diagrams for a ladder: I,"Comm. Pure Appl. Math., vol. 39, pp. 423483, 1986.
[30] J. O'Rourke,Art Gallery Theorems and Algorithms. Oxford, UK: Oxford University Press, 1987.
[31] M. Overmars and E. Welzl, "Construction of sparse visibility graphs," Tech. Rep., Univ. Utrecht, Holland, 1987.
[32] J. Pearl,Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, Mass: AddisonWesley, 1984.
[33] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: SpringerVerlag, 1985.
[34] H. Samet, "The quadtree and related hierarchical data structures,"Comput. Surveys, vol. 16, pp. 187260, 1984.
[35] M. Sharir, "Algorithmic motion planning in robotics,"Comput., vol. 22, no. 3, pp. 920, Mar. 1989.
[36] M. G. Slack, "Planning paths through a spatial hierarchy: Eliminating stairstepping effects," inSensor Fusion: Spatial Reasoning and Scene Interpretation, 1988, pp. 350357, SPIE vol. 1003.
[37] R. Tarjan and C. Van Wyk, "An O(nlog logn) algorithm for triangulating simple polygons,"SIAM J. Comput., vol. 17, 1988.
[38] G. T. Toussaint, "Shortest path solves translation separability of polygons," inProc. Int. Conf. Intell. Autonomous Syst.(Amsterdam), Dec. 1986, pp. 590600.
[39] E. Welzl, "Constructing the visibility graph fornline segments inO(n2)time,"Inform. Processing Lett., vol. 20, pp. 167171, 1985.