By Topic

Stochastic point location: A solution using learning automata and intelligent tertiary search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. J. Oommen ; Carleton University ; G. Raghunath

Consider the problem of a learning mechanism (robot, or algorithm) attempting to locate a point on a line.The mechanism interacts with a random "Oracle" ("Enviroriment") which essentially informs it, possibly erroneously, which way it should move. This problem is a generalization of the "Deterministic Point Location Problem" studied by Baeza-Yates et al. [1]. The first reported paper to solve this problem [14] presented a solution which operated in a discrefized space. In this paper we present a new scheme by which the point can be learnt using a combination of various learning principles and utilizes the generalized philosophy of Bentley and Yao's unbounded binary search algorithm [151. The heart of the strategy involves performing a controlled random walk on the underlying space and then intelligently pruning the space using an adaptive tertiary search. The overall learning scheme is shown to be e-optimal. As in the case of [141 the application of the solution in non-linear optimization has been alluded to. Our strategy can be utilized to determine the best pararneter to be used in an optimization module.

Published in:

ISAI/IFIS 1996. Mexico-USA Collaboration in Intelligent Systems Technologies. Proceedings

Date of Conference:

15-15 Nov. 1996