By Topic

A Learning Automaton Solution to the Stochastic Minimum-Spanning Circle Problem

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
$31 $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

1 Author(s)

The minimum-spanning circle (MSC) of N points in the plane is the smalest circle that encloses these points. The problem of computing the MSC of N stochastically varying points in the plane is considered. We propose a solution to the problem that involves a heirarchy of learning automata. The automata used in this solution are the Absorbing discretized linear Inaction-Penalty (ADLIP) automata, which are the only known linear automata which are of an inaction-penalty type and yet asymptotically optimal.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:16 ,  Issue: 4 )