_index.org

POMDP-lite

Last edited: August 8, 2025

What if our initial state never change or is deterministically changing? For instance, say, for localization. This should make solving a POMDP easier.

POMDP-lite

  • \(X\) fully observable states
  • \(\theta\) hidden parameter: finite amount of values \(\theta_{1 \dots N}\)
  • where \(S = X \times \theta\)

we then assume conditional independence between \(x\) and \(\theta\). So: \(T = P(x’|\theta, x, a)\), where \(P(\theta’|\theta,x,a) = 1\) (“our hidden parameter is known or deterministically changing”)

POMDPs Index

Last edited: August 8, 2025

a class about POMDPs

ThemeTopics
Robot dogsNeBula, AISR NeBula
ApplicationsPOMDSoar,
Offline SolversPBVI, HSVI, Perseus
Offline SolversSARSOP, E-PCA, CALP
Policy GraphsHansen, MCVI, PGA
Online SolversAEMS, POMCP, DESPOT
Moar Online MethodsIS-DESPOT, POMCPOW, AdaOPS
POMDPishMOMDP, POMDP-lite, rho-POMDPs
Memoryless + Policy SearchSarsa (Lambda), JSJ, Pegasus
Hierarchical DecompositionOption, MaxQ, LTRDP
Hybrid PlanningHybPlan, LetsDrive, BetaZero
LQR + Shared AutonomyiLQR, Hindsight, TrustPOMDP
Multi-AgentFactored MDPs, FV-POMCPs, G-DICE

Other Content

Population Based Training

Last edited: August 8, 2025

Jury based work

POS Tagging

Last edited: August 8, 2025
  • closed class words - words with fixed memberships (prepositions, conjunctivas, etc.); not being created or added much, used for grammatical function
  • open class words - words that are set as content, and are focused on content

power (math)

Last edited: August 8, 2025

For some \(a \in \mathbb{F}\), we define \(a^m\) to be \(a\) multiplied with itself \(m\) times.

additional information

  • \((a^m)^n = a^{mn}\)
  • \((ab)^m = a^mb^m\)