Visual reply to map-related queries-a free space graph approach

Given a map which describes an obstacle-cluttered environment, it is possible to pose a number of different queries. One such query might be whether or not the line-of-sight joining an arbitrary pair of points is obstructed. Another question might be that of finding the shortest path between any pair of points. A third problem might be to describe or collect all points lying within a specified radius of some source-point; here, this type of problem is called a localization query. The solution for a localization query is perhaps best presented graphically, i.e., in visual terms. For the two-dimensional case, a free space graph approach for deriving solutions to visibility and shortest path queries is described. How a simple extension of this method can be used to produce visual replies to localization queries is discussed.<<ETX>>

[1]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[2]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Erland Jungert,et al.  Heuristic Traversal Of A Free Space Graph , 1989, Optics East.

[4]  Ernest L. Hall,et al.  Automatic Operation For A Robot Lawn Mower , 1987, Other Conferences.

[5]  Godfried T. Toussaint.  Shortest Path Solves Translation Separability of Polygons , 1986, IAS.

[6]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Erland Jungert,et al.  A knowledge-based approach to the shortest path problem in a digitized map , 1988, [Proceedings] 1988 IEEE Workshop on Visual Languages.