A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions

Applied Intelligence

Volumn 41, Issue 3, 2014, Pages 974-985

  Zhang, Xuan ^a   Granmo, Ole Christoffer ^a   Oommen, B John ^a,b   Jiao, Lei ^a  

^a UNIVERSITY OF AGDER   (Norway)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Absorbing CPA; CPA; Pursuit algorithms; optimality

Indexed keywords

ESTIMATION;

ABSORBING CPA; ESTIMATOR ALGORITHMS; FUNDAMENTAL PRINCIPLES; MONOTONICITY PROPERTY; OPTIMALITY; PROBABILITY ESTIMATE; PURSUIT ALGORITHMS; TRADITIONAL APPROACHES;

PROBABILITY;

EID: 84918808652     PISSN: 0924669X     EISSN: 15737497     Source Type: Journal    
DOI: 10.1007/s10489-014-0541-1     Document Type: Article

References (30)

1. Zhang X, Granmo O-C, Oommen B J, Jiao L (2013) On using the theory of regular functions to prove the ε-optimality of the continuous pursuit learning automaton. In: Proceedings of IEA-AIE 2013. Springer, Amsterdan, pp 262–271
2. Ryan M, Omkar T (2012) On ε-optimality of the pursuit learning algorithm. J Appl Probab 49(3):795–805
3. Oommen B J, Granmo O-C, Pedersen A (2007) Using stochastic AI techniques to achieve unbounded resolution in finite player Goore Games and its applications. In: Proceedings of IEEE symposium on computational intelligence and games. Honolulu, pp 161–167
4. Granmo O-C, Glimsdal S (2013) Accelerated Bayesian learning for decentralized two-armed bandit based decision making with applications to the goore game. Appl Intell 38:479–488
5. Beigy H, Meybodi M R (2000) Adaptation of parameters of BP algorithm using learning automata. In: Proceedings of 6th Brazilian symposium on neural networks. JR, Brazil, pp 24–31
6. Granmo O-C, Oommen B J, Myrer S-A, Olsen M G (2007) Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation. IEEE Trans Syst Man Cybern B 37(1):166–175
7. Unsal C, Kachroo P, Bay J S (1999) Multiple stochastic learning automata for vehicle path control in an automated highway system. IEEE Trans Syst Man Cybern 29:120–128
8. Oommen B J, Roberts T D (2000) Continuous learning automata solutions to the capacity assignment problem. IEEE Trans Comput 49:608–620
9. Granmo O-C, Oommen B J (2006) On allocating limited sampling resources using a learning automata-based solution to the fractional knapsack problem. In: Proceedings of the 2006 international intelligent information processing and web mining conference, Advances in Soft Computing, vol. 35. Ustron, Poland, pp 263–272
10. Granmo O-C, Oommen B J (2010) Optimal sampling for estimation with constrained resources using a learning automaton-based solution for the nonlinear fractional knapsack problem. Appl Intell 33(1):3–20
11. Granmo O-C (2010) Solving stochastic nonlinear resource allocation problems using a hierarchy of twofold resource allocation automata. IEEE Trans Comput 59(4):545–560
12. Oommen B J, Croix T D S (Apr. 1997) String taxonomy using learning automata. IEEE Trans Syst Man Cybern 27:354–365
13. Oommen B J, Croix T D S (1996) Graph partitioning using learning automata. IEEE Trans Comput 45:195–208
14. Dean T, Angluin D, Basye K, Engelson S, Aelbling L, Maron O (1995) Inferring finite automata with stochastic output functions and an application to map learning. Mach Learn 18:81–108
15. Yazidi A, Granmo O-C, Oommen B J (2012) Service selection in stochastic environments: A learning-automaton based solution. Appl Intell 36:617–637
16. Vafashoar R, Meybodi M R, Momeni A A H (2012) Cla-de: a hybrid model based on cellular learning automata for numerical optimization. Appl Intell 36:735–748
17. Torkestani J A (2012) An adaptive focused web crawling algorithm based on learning automata. Appl Intell 37:586–601
18. 3 omni-directional mobile microrobot. Appl Intell 34:211–225
19. Erus G, Polat F (2007) A layered approach to learning coordination knowledge in multiagent environments. Appl Intell 27:249–267
20. Hong J, Prabhu V V (2004) Distributed reinforcement learning control for batch sequencing and sizing in just-in-time manufacturing systems. Appl Intell 20:71–87
21. Narendra K S, Thathachar M A L (1989) Learning automata: an introduction. Prentice Hall
22. Thathachar M A L, Sastry P S (1986) Estimator algorithms for learning automata. In: Proceedings of the platinum jubilee conference on systems and signal processing. Bangalore, India, pp 29–32
23. Oommen B J, Lanctot J K (1990) Discretized pursuit learning automata. IEEE Trans Syst Man Cybern 20:931–938
24. Lanctot J K, Oommen B J (1991) On discretizing estimator-based learning algorithms. IEEE Trans Syst Man Cybern B Cybern 2:1417–1422
25. Lanctot J K, Oommen B J (1992) Discretized estimator learning automata. IEEE Trans Syst Man Cybern B Cybern 22(6):1473–1483
26. Rajaraman K, Sastry P S (1996) Finite time analysis of the pursuit algorithm for learning automata. IEEE Trans Syst Man Cybern B Cybern 26:590–598
27. Oommen B J, Agache M (2001) Continuous and discretized pursuit learning schemes: various algorithms and their comparison,”. IEEE Trans Syst Man Cybern B Cybern 31(3):277–287
28. Oommen B J (1986) Absorbing and ergodic discretized two-action learning automata. IEEE Trans Syst Man Cybern 16:282–296
29. Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58:13–30
30. Zhang X, Granmo O-C, Oommen B J (2013) On incorporating the paradigms of discretization and Bayesian estimation to create a new family of pursuit learning automata. Appl Intell 39:782–792