The minimum-spanning circle (MSC of N points in the plane is the smallest 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 (ADL<inf>IP</inf>) automata, which are the only known linear automata which are of an inaction-penalty type and yet asymptotically optimal. Copyright

Additional Metadata
Persistent URL dx.doi.org/10.1109/TSMC.1986.289265
Journal IEEE Transactions on Systems, Man and Cybernetics
Citation
Oommen, J. (1986). A Learning Automaton Solution to the Stochastic Minimum-Spanning Circle Problem. IEEE Transactions on Systems, Man and Cybernetics, 16(4), 598–603. doi:10.1109/TSMC.1986.289265