R. Smallwood and E. Sondik, The optimal control of partially observable Markov decision processes over a nite horizon, Operation Research, vol.21, p.10711088, 1973.

S. Thrun, Probabilistic algorithms in robotics, p.93109, 2000.

S. Ji and L. Carin, Cost-sensitive feature acquisition and classication

A. Hero, D. Castan, D. Cochran, and K. Kastella, Foundations and Applications of Sensor Management, 2007.
DOI : 10.1007/978-0-387-49819-5

A. Cassandra, Exact and approximate algorithms for partially observable Markov decision processes, 1998.

R. Bellman, The theory of dynamic programming, Bull. Amer. Math. Soc, vol.60, p.503516, 1954.

G. Monahan, A survey of partially observable Markov decision processes, Management Science, vol.28, p.116, 1982.

M. Hauskrecht, Value-function approximations for partially observable Markov decision processes, Journal of Articial Intelligence Research, vol.13, p.3394

W. Lovejoy, Computationally Feasible Bounds for Partially Observed Markov Decision Processes, Operations Research, vol.39, issue.1, p.162175
DOI : 10.1287/opre.39.1.162

J. Pineau, G. Gordon, and S. Thrun, Anytime point-based approximations for large POMDPs, Journal of Articial Intelligence Research (JAIR), vol.27, p.335380, 2006.

M. Spaan and N. Vlassis, Perseus: Randomized point-based value iteration for POMDPs, Journal of Articial Intelligence Research, vol.24, 2005.

T. Smith and R. Simmons, Point-based POMDP algorithms: Improved analysis and implementation, Proc. of the Int. Conf. on Uncertainty in Articial Intelligence (UAI), 2005.

H. Kurniawati, D. Hsu, and W. Lee, SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces, Robotics: Science and Systems IV, 2008.
DOI : 10.15607/RSS.2008.IV.009

R. Kaplow, Point-based POMDP solvers: Survey and comparative analysis, 2010.

R. Saigal, On Piecewise Linear Approximations to Smooth Mappings, Mathematics of Operations Research, vol.4, issue.2, p.153161, 1979.
DOI : 10.1287/moor.4.2.153

M. Spaan, Cooperative active perception using POMDPs, AAAI 2008 Workshop on Advancements in POMDP Solvers, 2008.
DOI : 10.1109/iros.2010.5648856

S. Ross, J. Pineau, S. Paquet, and B. , Chaib-draa. Online planning algorithms for POMDPs, Journal of Articial Intelligence Research (JAIR), vol.32, p.663704, 2008.

. Proof, Let us assume that V n?1 (b) is a convex function, then we can show that V n (b) is also convex as follows. First, the value function in Eq. 1 can be expressed LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615