Title

Autonomous search in complex spaces

Keywords

Greedy and Infinite Horizon Algorithms; Optimal Strategies; Search

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.

Publication Date

1-1-1998

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume

1513

Number of Pages

13-28

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1007/3-540-49653-x_2

Socpus ID

84945197029 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84945197029

This document is currently not available here.

Share

COinS