Misplaced Pages

Partially observable Markov decision process

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from POMDP) Generalization of a Markov decision process

A partially observable Markov decision process (POMDP) is a generalization of a Markov decision process (MDP). A POMDP models an agent decision process in which it is assumed that the system dynamics are determined by an MDP, but the agent cannot directly observe the underlying state. Instead, it must maintain a sensor model (the probability distribution of different observations given the underlying state) and the underlying MDP. Unlike the policy function in MDP which maps the underlying states to the actions, POMDP's policy is a mapping from the history of observations (or belief states) to the actions.

The POMDP framework is general enough to model a variety of real-world sequential decision processes. Applications include robot navigation problems, machine maintenance, and planning under uncertainty in general. The general framework of Markov decision processes with imperfect information was described by Karl Johan Åström in 1965 in the case of a discrete state space, and it was further studied in the operations research community where the acronym POMDP was coined. It was later adapted for problems in artificial intelligence and automated planning by Leslie P. Kaelbling and Michael L. Littman.

An exact solution to a POMDP yields the optimal action for each possible belief over the world states. The optimal action maximizes the expected reward (or minimizes the cost) of the agent over a possibly infinite horizon. The sequence of optimal actions is known as the optimal policy of the agent for interacting with its environment.

Definition

Formal definition

A discrete-time POMDP models the relationship between an agent and its environment. Formally, a POMDP is a 7-tuple ( S , A , T , R , Ω , O , γ ) {\displaystyle (S,A,T,R,\Omega ,O,\gamma )} , where

  • S {\displaystyle S} is a set of states,
  • A {\displaystyle A} is a set of actions,
  • T {\displaystyle T} is a set of conditional transition probabilities between states,
  • R : S × A → R {\displaystyle R:S\times A\to \mathbb {R} } is the reward function.
  • Ω {\displaystyle \Omega } is a set of observations,
  • O {\displaystyle O} is a set of conditional observation probabilities, and
  • γ ∈ [ 0 , 1 ) {\displaystyle \gamma \in [0,1)} is the discount factor.

At each time period, the environment is in some state s ∈ S {\displaystyle s\in S} . The agent takes an action a ∈ A {\displaystyle a\in A} , which causes the environment to transition to state s ′ {\displaystyle s'} with probability T ( s ′ ∣ s , a ) {\displaystyle T(s'\mid s,a)} . At the same time, the agent receives an observation o ∈ Ω {\displaystyle o\in \Omega } which depends on the new state of the environment, s ′ {\displaystyle s'} , and on the just taken action, a {\displaystyle a} , with probability O ( o ∣ s ′ , a ) {\displaystyle O(o\mid s',a)} (or sometimes O ( o ∣ s ′ ) {\displaystyle O(o\mid s')} depending on the sensor model). Finally, the agent receives a reward r {\displaystyle r} equal to R ( s , a ) {\displaystyle R(s,a)} . Then the process repeats. The goal is for the agent to choose actions at each time step that maximize its expected future discounted reward: E [ ∑ t = 0 ∞ γ t r t ] {\displaystyle E\left} , where r t {\displaystyle r_{t}} is the reward earned at time t {\displaystyle t} . The discount factor γ {\displaystyle \gamma } determines how much immediate rewards are favored over more distant rewards. When γ = 0 {\displaystyle \gamma =0} the agent only cares about which action will yield the largest expected immediate reward; when γ → 1 {\displaystyle \gamma \rightarrow 1} the agent cares about maximizing the expected sum of future rewards.

Discussion

Because the agent does not directly observe the environment's state, the agent must make decisions under uncertainty of the true environment state. However, by interacting with the environment and receiving observations, the agent may update its belief in the true state by updating the probability distribution of the current state. A consequence of this property is that the optimal behavior may often include (information gathering) actions that are taken purely because they improve the agent's estimate of the current state, thereby allowing it to make better decisions in the future.

It is instructive to compare the above definition with the definition of a Markov decision process. An MDP does not include the observation set, because the agent always knows with certainty the environment's current state. Alternatively, an MDP can be reformulated as a POMDP by setting the observation set to be equal to the set of states and defining the observation conditional probabilities to deterministically select the observation that corresponds to the true state.

Belief update

After having taken the action a {\displaystyle a} and observing o {\displaystyle o} , an agent needs to update its belief in the state the environment may (or not) be in. Since the state is Markovian (by assumption), maintaining a belief over the states solely requires knowledge of the previous belief state, the action taken, and the current observation. The operation is denoted b ′ = τ ( b , a , o ) {\displaystyle b'=\tau (b,a,o)} . Below we describe how this belief update is computed.

After reaching s ′ {\displaystyle s'} , the agent observes o ∈ Ω {\displaystyle o\in \Omega } with probability O ( o ∣ s ′ , a ) {\displaystyle O(o\mid s',a)} . Let b {\displaystyle b} be a probability distribution over the state space S {\displaystyle S} . b ( s ) {\displaystyle b(s)} denotes the probability that the environment is in state s {\displaystyle s} . Given b ( s ) {\displaystyle b(s)} , then after taking action a {\displaystyle a} and observing o {\displaystyle o} ,

b ′ ( s ′ ) = η O ( o ∣ s ′ , a ) ∑ s ∈ S T ( s ′ ∣ s , a ) b ( s ) {\displaystyle b'(s')=\eta O(o\mid s',a)\sum _{s\in S}T(s'\mid s,a)b(s)}

where η = 1 / Pr ( o ∣ b , a ) {\displaystyle \eta =1/\Pr(o\mid b,a)} is a normalizing constant with Pr ( o ∣ b , a ) = ∑ s ′ ∈ S O ( o ∣ s ′ , a ) ∑ s ∈ S T ( s ′ ∣ s , a ) b ( s ) {\displaystyle \Pr(o\mid b,a)=\sum _{s'\in S}O(o\mid s',a)\sum _{s\in S}T(s'\mid s,a)b(s)} .

Belief MDP

A Markovian belief state allows a POMDP to be formulated as a Markov decision process where every belief is a state. The resulting belief MDP will thus be defined on a continuous state space (even if the "originating" POMDP has a finite number of states: there are infinite belief states (in B {\displaystyle B} ) because there are an infinite number of probability distributions over the states (of S {\displaystyle S} )).

Formally, the belief MDP is defined as a tuple ( B , A , τ , r , γ ) {\displaystyle (B,A,\tau ,r,\gamma )} where

  • B {\displaystyle B} is the set of belief states over the POMDP states,
  • A {\displaystyle A} is the same finite set of action as for the original POMDP,
  • τ {\displaystyle \tau } is the belief state transition function,
  • r : B × A → R {\displaystyle r:B\times A\to \mathbb {R} } is the reward function on belief states,
  • γ {\displaystyle \gamma } is the discount factor equal to the γ {\displaystyle \gamma } in the original POMDP.

Of these, τ {\displaystyle \tau } and r {\displaystyle r} need to be derived from the original POMDP. τ {\displaystyle \tau } is

τ ( b , a , b ′ ) = ∑ o ∈ Ω Pr ( b ′ | b , a , o ) Pr ( o | a , b ) , {\displaystyle \tau (b,a,b')=\sum _{o\in \Omega }\Pr(b'|b,a,o)\Pr(o|a,b),}

where Pr ( o | a , b ) {\displaystyle \Pr(o|a,b)} is the value derived in the previous section and

P r ( b ′ | b , a , o ) = { 1 if the belief update with arguments  b , a , o  returns  b ′ 0 otherwise  . {\displaystyle Pr(b'|b,a,o)={\begin{cases}1&{\text{if the belief update with arguments }}b,a,o{\text{ returns }}b'\\0&{\text{otherwise }}\end{cases}}.}

The belief MDP reward function ( r {\displaystyle r} ) is the expected reward from the POMDP reward function over the belief state distribution:

r ( b , a ) = ∑ s ∈ S b ( s ) R ( s , a ) {\displaystyle r(b,a)=\sum _{s\in S}b(s)R(s,a)} .

The belief MDP is not partially observable anymore, since at any given time the agent knows its belief, and by extension the state of the belief MDP.

Policy and value function

Unlike the "originating" POMDP (where each action is available from only one state), in the corresponding Belief MDP all belief states allow all actions, since you (almost) always have some probability of believing you are in any (originating) state. As such, π {\displaystyle \pi } specifies an action a = π ( b ) {\displaystyle a=\pi (b)} for any belief b {\displaystyle b} .

Here it is assumed the objective is to maximize the expected total discounted reward over an infinite horizon. When R {\displaystyle R} defines a cost, the objective becomes the minimization of the expected cost.

The expected reward for policy π {\displaystyle \pi } starting from belief b 0 {\displaystyle b_{0}} is defined as

V π ( b 0 ) = ∑ t = 0 ∞ γ t r ( b t , a t ) = ∑ t = 0 ∞ γ t E [ R ( s t , a t ) ∣ b 0 , π ] {\displaystyle V^{\pi }(b_{0})=\sum _{t=0}^{\infty }\gamma ^{t}r(b_{t},a_{t})=\sum _{t=0}^{\infty }\gamma ^{t}E{\Bigl }}

where γ < 1 {\displaystyle \gamma <1} is the discount factor. The optimal policy π ∗ {\displaystyle \pi ^{*}} is obtained by optimizing the long-term reward.

π ∗ = argmax π   V π ( b 0 ) {\displaystyle \pi ^{*}={\underset {\pi }{\mbox{argmax}}}\ V^{\pi }(b_{0})}

where b 0 {\displaystyle b_{0}} is the initial belief.

The optimal policy, denoted by π ∗ {\displaystyle \pi ^{*}} , yields the highest expected reward value for each belief state, compactly represented by the optimal value function V ∗ {\displaystyle V^{*}} . This value function is solution to the Bellman optimality equation:

V ∗ ( b ) = max a ∈ A [ r ( b , a ) + γ ∑ o ∈ Ω Pr ( o ∣ b , a ) V ∗ ( τ ( b , a , o ) ) ] {\displaystyle V^{*}(b)=\max _{a\in A}{\Bigl }}

For finite-horizon POMDPs, the optimal value function is piecewise-linear and convex. It can be represented as a finite set of vectors. In the infinite-horizon formulation, a finite vector set can approximate V ∗ {\displaystyle V^{*}} arbitrarily closely, whose shape remains convex. Value iteration applies dynamic programming update to gradually improve on the value until convergence to an ϵ {\displaystyle \epsilon } -optimal value function, and preserves its piecewise linearity and convexity. By improving the value, the policy is implicitly improved. Another dynamic programming technique called policy iteration explicitly represents and improves the policy instead.

Approximate POMDP solutions

In practice, POMDPs are often computationally intractable to solve exactly. This intractability is often due to the curse of dimensionality or the curse of history (the fact that optimal policies may depend on the entire history of actions and observations). To address these issues, computer scientists have developed methods that approximate solutions for POMDPs. These solutions typically attempt to approximate the problem or solution with a limited number of parameters, plan only over a small part of the belief space online, or summarize the action-observation history compactly.

Grid-based algorithms comprise one approximate solution technique. In this approach, the value function is computed for a set of points in the belief space, and interpolation is used to determine the optimal action to take for other belief states that are encountered which are not in the set of grid points. More recent work makes use of sampling techniques, generalization techniques and exploitation of problem structure, and has extended POMDP solving into large domains with millions of states. For example, adaptive grids and point-based methods sample random reachable belief points to constrain the planning to relevant areas in the belief space. Dimensionality reduction using PCA has also been explored.

Online planning algorithms approach large POMDPs by constructing a new policy for the current belief each time a new observation is received. Such a policy only needs to consider future beliefs reachable from the current belief, which is often only a very small part of the full belief space. This family includes variants of Monte Carlo tree search and heuristic search. Similar to MDPs, it is possible to construct online algorithms that find arbitrarily near-optimal policies and have no direct computational complexity dependence on the size of the state and observation spaces.

Another line of approximate solution techniques for solving POMDPs relies on using (a subset of) the history of previous observations, actions and rewards up to the current time step as a pseudo-state. Usual techniques for solving MDPs based on these pseudo-states can then be used (e.g. Q-learning). Ideally the pseudo-states should contain the most important information from the whole history (to reduce bias) while being as compressed as possible (to reduce overfitting).

POMDP theory

Planning in POMDP is undecidable in general. However, some settings have been identified to be decidable (see Table 2 in, reproduced below). Different objectives have been considered. Büchi objectives are defined by Büchi automata. Reachability is an example of a Büchi condition (for instance, reaching a good state in which all robots are home). coBüchi objectives correspond to traces that do not satisfy a given Büchi condition (for instance, not reaching a bad state in which some robot died). Parity objectives are defined via parity games; they enable to define complex objectives such that reaching a good state every 10 timesteps. The objective can be satisfied:

  • almost-surely, that is the probability to satisfy the objective is 1;
  • positive, that is the probability to satisfy the objective is strictly greater than 0;
  • quantitative, that is the probability to satisfy the objective is greater than a given threshold.

We also consider the finite memory case in which the agent is a finite-state machine, and the general case in which the agent has an infinite memory.

Objectives Almost-sure (infinite memory) Almost-sure (finite memory) Positive (inf. mem.) Positive (finite mem.) Quantitative (inf. mem) Quantitative (finite mem.)
Büchi EXPTIME-complete EXPTIME-complete undecidable EXPTIME-complete undecidable undecidable
coBüchi undecidable EXPTIME-complete EXPTIME-complete EXPTIME-complete undecidable undecidable
parity undecidable EXPTIME-complete undecidable EXPTIME-complete undecidable undecidable

Applications

POMDPs can be used to model many kinds of real-world problems. Notable applications include the use of a POMDP in management of patients with ischemic heart disease, assistive technology for persons with dementia, the conservation of the critically endangered and difficult to detect Sumatran tigers and aircraft collision avoidance.

One application is a teaching case, a crying baby problem, where a parent needs to sequentially decide whether to feed the baby based on the observation of whether the baby is crying or not, which is an imperfect representation of the actual baby's state of hunger.

References

  1. Åström, K.J. (1965). "Optimal control of Markov processes with incomplete state information". Journal of Mathematical Analysis and Applications. 10: 174–205. doi:10.1016/0022-247X(65)90154-X.
  2. ^ Kaelbling, L.P., Littman, M.L., Cassandra, A.R. (1998). "Planning and acting in partially observable stochastic domains". Artificial Intelligence. 101 (1–2): 99–134. doi:10.1016/S0004-3702(98)00023-X.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  3. Sondik, E.J. (1971). The optimal control of partially observable Markov processes (PhD thesis). Stanford University. Archived from the original on October 17, 2019.
  4. Smallwood, R.D., Sondik, E.J. (1973). "The optimal control of partially observable Markov decision processes over a finite horizon". Operations Research. 21 (5): 1071–88. doi:10.1287/opre.21.5.1071.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  5. Sondik, E.J. (1978). "The optimal control of partially observable Markov processes over the infinite horizon: discounted cost". Operations Research. 26 (2): 282–304. doi:10.1287/opre.26.2.282.
  6. Hansen, E. (1998). "Solving POMDPs by searching in policy space". Proceedings of the Fourteenth International Conference on Uncertainty In Artificial Intelligence (UAI-98). arXiv:1301.7380.
  7. Hauskrecht, M. (2000). "Value function approximations for partially observable Markov decision processes". Journal of Artificial Intelligence Research. 13: 33–94. arXiv:1106.0234. doi:10.1613/jair.678.
  8. Lovejoy, W. (1991). "Computationally feasible bounds for partially observed Markov decision processes". Operations Research. 39: 162–175. doi:10.1287/opre.39.1.162.
  9. ^ Jesse Hoey; Axel von Bertoldi; Pascal Poupart; Alex Mihailidis (2007). "Assisting Persons with Dementia during Handwashing Using a Partially Observable Markov Decision Process". Proceedings of the International Conference on Computer Vision Systems. doi:10.2390/biecoll-icvs2007-89.
  10. ^ Jesse Hoey; Pascal Poupart; Axel von Bertoldi; Tammy Craig; Craig Boutilier; Alex Mihailidis. (2010). "Automated Handwashing Assistance For Persons With Dementia Using Video and a Partially Observable Markov Decision Process". Computer Vision and Image Understanding. 114 (5): 503–519. CiteSeerX 10.1.1.160.8351. doi:10.1016/j.cviu.2009.06.008.
  11. Pineau, J., Gordon, G., Thrun, S. (August 2003). "Point-based value iteration: An anytime algorithm for POMDPs" (PDF). International Joint Conference on Artificial Intelligence (IJCAI). Acapulco, Mexico. pp. 1025–32.{{cite conference}}: CS1 maint: multiple names: authors list (link)
  12. Hauskrecht, M. (1997). "Incremental methods for computing bounds in partially observable Markov decision processes". Proceedings of the 14th National Conference on Artificial Intelligence (AAAI). Providence, RI. pp. 734–739. CiteSeerX 10.1.1.85.8303.
  13. Roy, Nicholas; Gordon, Geoffrey (2003). "Exponential Family PCA for Belief Compression in POMDPs" (PDF). Advances in Neural Information Processing Systems.
  14. David Silver and Joel Veness (2010). Monte-Carlo planning in large POMDPs. Advances in neural information processing systems.
  15. Nan Ye, Adhiraj Somani, David Hsu, and Wee Sun Lee (2017). "DESPOT: Online POMDP Planning with Regularization". Journal of Artificial Intelligence Research. 58: 231–266. arXiv:1609.03250. doi:10.1613/jair.5328.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  16. Michael H. Lim, Tyler J. Becker, Mykel J. Kochenderfer, Claire J. Tomlin, and Zachary N. Sunberg (2023). "Optimality Guarantees for Particle Belief Approximation of POMDPs". Journal of Artificial Intelligence Research. 77: 1591–1636. arXiv:2210.05015. doi:10.1613/jair.1.14525.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  17. Francois-Lavet, V., Rabusseau, G., Pineau, J., Ernst, D., Fonteneau, R. (2019). On overfitting and asymptotic bias in batch reinforcement learning with partial observability. Journal of Artificial Intelligence Research (JAIR). Vol. 65. pp. 1–30. arXiv:1709.07796.{{cite conference}}: CS1 maint: multiple names: authors list (link)
  18. ^ Chatterjee, Krishnendu; Chmelík, Martin; Tracol, Mathieu (2016-08-01). "What is decidable about partially observable Markov decision processes with ω-regular objectives". Journal of Computer and System Sciences. 82 (5): 878–911. doi:10.1016/j.jcss.2016.02.009. ISSN 0022-0000.
  19. Hauskrecht, M., Fraser, H. (2000). "Planning treatment of ischemic heart disease with partially observable Markov decision processes". Artificial Intelligence in Medicine. 18 (3): 221–244. doi:10.1016/S0933-3657(99)00042-1. PMID 10675716.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  20. Chadès, I., McDonald-Madden, E., McCarthy, M.A., Wintle, B., Linkie, M., Possingham, H.P. (16 September 2008). "When to stop managing or surveying cryptic threatened species". Proc. Natl. Acad. Sci. U.S.A. 105 (37): 13936–40. Bibcode:2008PNAS..10513936C. doi:10.1073/pnas.0805265105. PMC 2544557. PMID 18779594.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  21. Kochenderfer, Mykel J. (2015). "Optimized Airborne Collision Avoidance". Decision Making Under Uncertainty. The MIT Press.
  22. Kochenderfer, Mykel J.; Wheeler, Tim A.; Wray, Kyle H. (2022). Algorithms for decision making. Cambridge, Massachusetts; London, England: MIT Press. p. 678. ISBN 9780262047012.
  23. Moss, Robert J. (Sep 24, 2021). "WATCH: POMDPs: Decision Making Under Uncertainty POMDPs.jl. Crying baby problem" (video). youtube.com. The Julia Programming Language.

External links

Categories: