Piecewise linear dynamic programming for constrained POMDPs

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 291-296

  Isom, Joshua D ^a   Meyn, Sean P ^b   Braatz, Richard D ^b  

^a SIKORSKY AIRCRAFT CORPORATION   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT FUNCTIONS; EXACT SOLUTIONS; IMPLICIT ENUMERATIONS; LINEAR PROGRAMS; MARKOV DECISION PROCESSES; MINIMAL REPRESENTATIONS; MIXED INTEGER LINEAR PROGRAMS; OBJECTIVE FUNCTIONS; PIECEWISE LINEAR; VALUE FUNCTIONS;

ARTIFICIAL INTELLIGENCE; BIONICS; DYNAMIC PROGRAMMING; FUNCTIONS; PIECEWISE LINEAR TECHNIQUES; PROBABILITY DENSITY FUNCTION; SYSTEMS ENGINEERING; VECTORS; WIRELESS LOCAL AREA NETWORKS (WLAN);

INTEGER PROGRAMMING;

EID: 57749182887     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Altman, E. 1999. Constrained Markov Decision Processes. Boca Raton, LA: CRC Press.
2. Cassandra, A. R. 1998. Exact and Approximate Algorithms for Partially Observable Markov Decision Processes. Ph.D. Dissertation, Brown University.
3. Feinberg, E. A., and Piunovskiy, A. B. 2000. Multiple objective nonatomic markov decision processes with total reward criteria. J. Math. Anal. Appl. 247:45-66.
4. Feng, Z., and Zilberstein, S. 2004. Region-based incremental pruning for POMDPs. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, 146-153.
5. Hansen, E. A. 1998. Finite Memory Control of Partially Observable Systems. PhD thesis, University of Massachusetts Amherst.
6. Hansen, E. A. 2007. Indefinite-horizon POMDPs with action-based termination. In 22nd National Conference on Artificial Intelligence.
7. Meyn, S. P. 2007. Control Techniques for Complex Networks. Cambridge, UK: Cambridge University Press.
8. Patek, S. D. 2001. On partially observed stochastic shortest path problems. In 40th IEEE Conference on Decision and Control.
9. Piunovskiy, A. B., and Mao, X. 2000. Constrained markovian decision processes: the dynamic programming approach. Operations research letters 27:119-126.
10. Poupart, P. 2005. Exploiting Structure to Efficiently Solve Large Scale Partially Observable Markov Decision Processes. PhD thesis, University of Toronto.
11. Puterman, M. L. 2005. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics. Hoboken, NJ: John Wiley & Sons.
12. Shiryaev, A. N. 1963. On optimum methods in quickest detection problems. Theory of Probability and Its Applications 8(1):22-46.
13. Spaan, M. T. J., and Vlassis, N. 2005. Perseus: Randomized point-based value iteration for POMDPs. Journal of Artificial Intelligence Research 24:195-220.
14. Tartakovsky, A. G., and Veeravalli, V. V. 2004. General asymptotic Bayesian theory of quickest change detection. Theory of Probability and Its Applications 49(3):458-497.
15. Zhao, Q., and Swami, A. 2007. A decision-theoretic framework for opportunistic spectrum access. IEEE Wireless Communications 14(4): 14-20.