Autonomous Search in Complex Spaces

  • Erol Gelenbe
Conference paper

DOI: 10.1007/3-540-49653-X_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1513)
Cite this paper as:
Gelenbe E. (1998) Autonomous Search in Complex Spaces. In: Research and Advanced Technology for Digital Libraries. ECDL 1998. Lecture Notes in Computer Science, vol 1513. Springer, Berlin, Heidelberg

Abstract

The search for information in a complex system space-such as the Web or large digital libraries, or in an unkown robotics environment-requires the design of efficient and intelligent strategies for (1) determining regions of interest using a variety of sensors, (2) detecting and classifying objects of interest, and (3) searching the space by autonomous agents. This paper discusses strategies for directing autonomous search based on spatio-temporal distributions. We discuss a model for search assuming that the environment is static, except for the effect of identifying object locations. Algorithms are designed and compared for autonomously directing a robot.

Keywords

Search Optimal Strategies Greedy and Infinite Horizon Algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-VerlagBerlin Heidelberg 1998

Authors and Affiliations

  • Erol Gelenbe
    • 1
  1. 1.School of Computer ScienceUniversity of Central FloridaOrlando

Personalised recommendations