Skip to main content

An Expert Database System For The Overland Search Problem

  • Conference paper
Datenbanksysteme in Büro, Technik und Wissenschaft

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 136))

  • 77 Accesses

Abstract

This paper describes a heuristic expert database system to solve the overland search problem. The task in this problem is to find the best path between two points on a geographic map. In our system the map is represented by a set of disjoint adjacent polygons. The cost of moving between two points within the same polygon is proportional to the distance between the two points. The map is stored in an INGRES relational database.

First, we present a basic system that performs a greedy path search to find the best path. The system is implemented in QUEL*, an extension of the INGRES query language QUEL that allows abstract data types and more sophisticated control structures for efficient rule processing. In particular, we make use of data types and operators for spatial objects and for program code.

In order to speed up the path search we suggest to utilize knowledge about the area to perform a hierarchical decomposition of the given problem. We also propose to perform an initial coarsening of the given map. On a coarsened map, the system will be able to find an approximation of a solution path very quickly.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Butler, M., private communication, 1985.

    Google Scholar 

  2. Guttman, A., “New Features for a Relational Data Base System to Support Computer Aided Design”, PhD Thesis, University of California, Berkeley, June 1984.

    Google Scholar 

  3. Harmon, S.Y., Gage, D.W., Aviles, W.A., and Bianchini, G.L, G.L., “Coordination of Intelligent Subsystems in Complex Robots”, Proc. The First Conference on Artificial Intelligence Applications, IEEE, Dec. 1984.

    Google Scholar 

  4. Horowitz, S.L., and Pavlidis, T., “Picture Segmentation by a Tree Traversal Algorithm”, J. ACM 23, 2, pp. 368–388, April 1976.

    Article  MATH  Google Scholar 

  5. Hunter, G.M., and Steiglitz, K., “Operations on Images Using Quadtrees”, IEEE Trans. Pattern Anal. Mach. Intell. 1, 2, pp. 145–153, April 1979.

    Article  Google Scholar 

  6. Isik, C., and Meystel, A., “Knowledge-Based Pilot for an Intelligent Mobile Autonomous System”, Proc. The First Conference on Artificial Intelligence Applications, IEEE, Dec. 1984.

    Google Scholar 

  7. Kuan, D., et al., “Automatic Path Planning for a Mobile Robot Using a Mixed Representation of Free Space”, Proc. The First Conference on Artificial Intelligence Applications, IEEE, Dec. 1984.

    Google Scholar 

  8. Kung, R., et al., “Heuristic Search in Data Base Systems”, Proc. 1st International Conference on Expert Database Systems, Kiowah, S.C., October 1984.

    Google Scholar 

  9. Kung, R., private communication, 1985.

    Google Scholar 

  10. Meystel, A., “Automated Map Transformation for Unmanned Planning and Navigation”, Proc. 9th W.T. Pecora Memorial Remote Sensing Symposium, IEEE, Oct. 1984.

    Google Scholar 

  11. Nievergelt, J., and Preparata, F.P., “Plane-Sweep Algorithms for Intersecting Geometric Figures”, Comm. ACM, Vol. 25, No. 10, October 1982.

    Google Scholar 

  12. Parodi, A, A., “A Route Planning System for an Autonomous Vehicle”, Proc. The First Conference on Artificial Intelligence Applications, IEEE, Dec. 1984.

    Google Scholar 

  13. Pearl, J., “Heuristics: Intelligent Search Strategies for Computer Problem Solving”, Addison Wesley, Reading, Mass., 1984.

    Google Scholar 

  14. Preparata, F.P. and Shamos, M., “Computational Geometry”, Springer-Verlag, New York, NY, 1985.

    Google Scholar 

  15. Relational Technology Inc., “INGRES/EQUEL/FORTRAN User’s Guide”,Version 3.0, VAX/VMS, Oct. 1984.

    Google Scholar 

  16. Samet84] Samet, H., “The Quadtree and Related Hierarchical Data Structures”, Computing Surveys, Vol. 16, No. 2, pp. 187 - 260, 1984.

    Article  MathSciNet  Google Scholar 

  17. Stonebraker, M., et al., “The Design and Implementation of INGRES”, ACM Transactions on Database Systems, Vol. 1, No. 3, pp. 189–222, Sep. 1976.

    Article  Google Scholar 

  18. Stonebraker, M., “Application of Abstract Data Types and Abstract Indices to CAD Data”, Proc. Engineering Applications Stream of the ACM-SIGMOD International Conference on Management of Data, San Jose, Ca., May 1983.

    Google Scholar 

  19. Stonebraker, M., et al., “Extending a Data Base System with Procedures”, unpublished manuscript, University of California, Berkeley, Ca., 1985.

    Google Scholar 

  20. Stonebraker, M., “Triggers and Inference in Data Base Systems”, Proc. 1985 Islamoora Conference on Expert Systems, Islamoora, Fla., Feb. 1985 (to appear as Springer Verlag book, edited by M. Brodie).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Günther, O. (1987). An Expert Database System For The Overland Search Problem. In: Schek, HJ., Schlageter, G. (eds) Datenbanksysteme in Büro, Technik und Wissenschaft. Informatik-Fachberichte, vol 136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72617-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-72617-0_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17736-4

  • Online ISBN: 978-3-642-72617-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics