A near optimal policy for channel allocation in cognitive radio

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

Volumn 5323 LNAI, Issue , 2008, Pages 69-81

  Filippi, Sarah ^a   Cappé, Olivier ^a   Clérot, Fabrice ^b   Moulines, Eric ^a  

^a INSTITUT TELECOM   (France)

^b ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL COMMUNICATION SYSTEMS; LEARNING ALGORITHMS; OPTIMIZATION; REINFORCEMENT LEARNING;

CHANNEL ALLOCATIONS; DIGITAL COMMUNICATIONS; DISCRETIZATION SCHEME; INTERNAL POINTS; INTERNAL STATES; MARKOV DECISION PROCESS (MDP); PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES (POMDPS); VALUE ITERATION (VI);

REINFORCEMENT;

EID: 58449099675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89722-4_6     Document Type: Conference Paper

References (14)

1. Cassandra, A., Littman, M., Zhang, N., et al.: Incremental pruning: A simple, fast, exact method for partially observable Markov decision processes. In: Proceedings of Thirteenth Conference on Uncertainty in Artificial Intelligence, pp. 54-61 (1997)
2. Meuleau, N., Kim, K., Kaelbling, L., Cassandra, A.: Solving POMDPs by searching the space of finite policies. In: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, pp. 417-426 (1999)
3. Aberdeen, D.: Policy-Gradient Algorithms for Partially Observable Markov Decision Processes. Ph.D thesis, Australian National University (2003)
4. Pineau, J., Gordon, G., Thrun, S.: Anytime point-based approximations for large POMDPs. Journal of Artificial Intelligence Research 27, 335-380 (2006)
5. Astrom, K.: Optimal control of Markov decision processes with incomplete state estimation. Journal of Mathematical Analysis and Applications 10, 174-205 (1965)
6. Sondik, E.: The Optimal Control of Partially Observable Markov Processes Over the Infinite Horizon: Discounted Costs. Operations Research 26(2), 282-304 (1978)
7. Kaelbling, L., Littman, M., Cassandra, A.: Planning and acting in partially observable stochastic domains. Artificial Intelligence 101(1), 99-134 (1996)
8. Zhao, Q., Tong, L., Swami, A.: Decentralized cognitive MAC for dynamic spectrum access. In: Proc. First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, pp. 224-232 (2007)
9. Whittle, P.: Restless Bandits: Activity Allocation in a Changing World. Journal of Applied Probability 25, 287-298 (1988)
10. Papadimitriou, C., Tsitsiklis, J.: The complexity of optimal queueing network control. In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, pp. 318-322 (1994)
11. Le Ny, J., Dahleh, M., Feron, E.: Multi-UAV Dynamic Routing with Partial Observations using Restless Bandits Allocation Indices. LIDS, Massachusetts Institute of Technology, Tech. Rep. (2007)
12. Guha, S., Munagala, K.: Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards. In: 48th Annual IEEE Symposium on Foundations of Computer Science, 2007. FOCS 2007, pp. 483-493 (2007)
13. Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York (1994)
14. Bonet, B.: An e-optimal grid-based algorithm for partially observable Markov decision processes. In: 19th International Conference on Machine Learning, Sydney, Australia (June 2002)