Symbolic and geometric connectivity graph methods for route planning in digitized maps

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 14, Issue 5, 1992, Pages 549-565

  Holmes, Peter D ^a   Jungert, Erland R A ^a  

^a SWEDISH DEFENCE RESEARCH AGENCY   (Sweden)

Author keywords

Computer geometry connectivity graph; dig ; itized maps; knowledge based methods; path planning; route planning; spatial reasoning

Indexed keywords

EXPERT SYSTEMS - KNOWLEDGE BASES; IMAGE PROCESSING; MATHEMATICAL TECHNIQUES - GEOMETRY; MATHEMATICAL TECHNIQUES - HEURISTIC;

BEARING-POINT-GRAPH; FUNNEL GROWTH; GEOMETRIC CONNECTIVITY GRAPH METHOD; HEURISTIC MODULE; INFERENCE RULES TILE GRAPH; SYMBOLIC PROJECTIONS;

MAPS AND MAPPING;

EID: 0026866905     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.134059     Document Type: Article

References (39)

1. J. F. Allen, “Maintaining knowledge about temporal intervals,” Commun. ACM, Vol. 26, No. 11, pp. 832–843, Nov. 1983.
2. S. -K. Chang and E. Jungert, “A spatial knowledge structure for image information systems using symbolic projections,” in Visual Languages and Applications (T. Ichikawa, E. Jungert, and R. R. Korfhage, Eds.). New York: Plenum, 1990, pp. 277–303.
3. S. -K. Chang, O. -Y. Shi, and C. -W. Yan, “Iconic indexing by 2-D strings,” IEEE Trans. Patt. Anal. Machine Intell., Vol. PAMI-9, No. 3, pp. 413–428, May 1987.
4. E. W. Dijkstra, “A note on two problems in connection with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959.
5. L. Dorst and P. W. Verbeek, “The constrained distance transformation: A pseudo-Euclidean recursive implementation of the Lee-algorithm,” in Signal Processing III; Theories and Applications, (I. T. Young et 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. 153–174, 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, 175–179, 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. 209–233, 1987.
9. S. Hertel and K. Mehlhorn, “Fast triangulation of simple polygons,” in Proc. 1983 Int. Conf. Foundations Comput. Sci. (Tucson AZ), Nov. 1983, pp. 207–218.
10. P. D. Holmes, “Visual reply to map-related queries—A free space graph approach,” J Visual Languages Comput., Vol. 2, No. 2, pp 143–162, June 1991.
11. P. D. Holmes and E. Jungert, “Shortest paths in a digitized map using a tile-based data structure,” in Proc. Third Int. Conf. Eng. Graphics Descriptive Geometry (Vienna, Austria), July 1988, pp. 238–245, vol. 1.
12. P. D. Holmes and E. Jungert, “Heuristic traversal of a free space graph,” in Sensor Fusion: Spatial Reasoning and Scene Interpretation, 1988, pp. 495–503, 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,” in Mobile Robots, 1986, pp. 344–354, SPIE vol. 727.
14. E. Jungert, “Run length code as an object-oriented spatial data structure,” in Proc. IEEE Workshop Languages Automat. (Singapore), Aug. 1986, 66–70.
15. E. Jungert, “Extended symbolic projections as a knowledge structure for spatial reasoning and planning,” in Pattern 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. 157–162.
17. E. Jungert and S. -K. Chang, “An algebra for symbolic image manipulation and transformation,” in Visual Database Systems (T. L. Kunii, Ed.). Amsterdam: North-Holland, 1989.
18. E. Jungert, “An image algebra for pictorial data manipulation,” to be published in Comput. Vision Graphics Image Processing (CVGIP): Image Understanding.
19. E. Jungert and P. D. Holmes, “A knowledge-based approach to the shortest path problem in a digitized map,” in Proc. IEEE Workshop Visual Languages (Pittsburgh, PA), Oct. 1988, pp. 248–255.
20. E. Jungert and P. Hampus, “A database structure for an object-oriented raster-based geographical information system,” in Proc. 1st Euro. Conf. Geograph. Inform. Syst. (Amsterdam), Apr. 10–13, 1990, pp. 526–533.
21. E. Jungert and P. D. Holmes, “A hierarchical knowledge structure for heuristic path planning,” in Proc. Second Int. Conf. Intell. Autonomous Syst. (Amsterdam), Dec. 1989, pp 230–240.
22. S. Kambhampati and L. S. Davis, “Multiresolution path planning for mobile robots,” IEEE J. Robotics Automat., Vol. RA-2, No. 3, pp. 135–145, Sept. 1986.
23. D. T. Lee and F. P. Preparata, “Euclidean shortest paths in the presence of rectilinear barriers,” Networks, vol. 14, pp. 393–110, 1984.
24. T. Lv>Mn»-Pf[«, “Autvmatis planning of manipulator transfer movements,” IEEE Trans. Syst. Man Cybern., Vol. SMC-11, No. 10, pp. 681–698, Oct. 1981.
25. A. C. -C. Meng, “Reasoning about free space and motion planning problems,” to be published in Advances in Spatial Reasoning, ABLEX Inc.
26. A. Meystel, A. Guez, and G. Hillel, “Minimum time path planning for a robot,” in Proc. IEEE 1986 Int. Conf. Robotics Automat., pp. 1678–1687, 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. 129–198, 1987.
28. N. J. Nilsson, Principles of Artificial Intelligence. New York: Tioga, 1979.
29. C. O’Dunlaing, M. Sharir, and C. Yap, “Generalized Voronoi diagrams for a ladder: I,” Comm. Pure Appl. Math., vol. 39, pp. 423–483, 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, MA: Addison-Wesley, 1984.
33. F. P. Preparata and M. I. Shamos, Computational Geometry, An Introduction. New York: Springer-Verlag, 1985.
34. H. Samet, “The quadtree and related hierarchical data structures,” ACM Comput. Surveys, Vol. 16, No. 2, pp. 187–260, June 1984.
35. M. Sharir, “Algorithmic motion planning in robotics,” Comput., Vol. 22, No. 3, pp. 9–20, Mar. 1989.
36. M. G. Slack, “Planning paths through a spatial hierarchy: Eliminating stair-stepping effects,” in Sensor Fusion: Spatial Reasoning and Scene Interpretation, 1988, pp. 350–357, SPIE vol. 1003.
37. R. E. Taijan and C. Van Wyk, “An O(nloglogn) time algorithm for triangulating simple polygons,” SIAM J. Comp., vol. 17, pp. 143–178, 1988.
38. G. T. Toussaint, “Shortest path solves translation separability of polygons,” in Proc. Int. Conf. Intell. Autonomous Syst. (Amsterdam), Dec. 1986, pp. 590–600.
39. 2) time,” Inform. Processing Lett., vol. 20, pp. 167–171, 1985.