diff --git a/dev/.documenter-siteinfo.json b/dev/.documenter-siteinfo.json index 67a70a0..f7dd098 100644 --- a/dev/.documenter-siteinfo.json +++ b/dev/.documenter-siteinfo.json @@ -1 +1 @@ -{"documenter":{"julia_version":"1.10.4","generation_timestamp":"2024-06-14T14:21:42","documenter_version":"1.4.1"}} \ No newline at end of file +{"documenter":{"julia_version":"1.10.4","generation_timestamp":"2024-06-14T14:35:27","documenter_version":"1.4.1"}} \ No newline at end of file diff --git a/dev/index.html b/dev/index.html index e6d7267..520ef9c 100644 --- a/dev/index.html +++ b/dev/index.html @@ -44,4 +44,4 @@ Solving... Gap closed! Solved! -Reward: 5.314410000000001

Documentation

MCVI.MCVISolver — Type
MCVISolver <: POMDPs.Solver

The MCVI solver is a solver for POMDPs that uses Monte Carlo Value Iteration to solve the problem. Described in Bai, H., Hsu, D., & Lee, W. S. (2014). Integrated perception and planning in the continuous space: A POMDP approach. The International Journal of Robotics Research, 33(9), 1288-1302.

Fields

  • simulater::POMDPs.Simulator
  • root::Union{BeliefNode, Nothing}
  • n_iter::Int64: Number of iterations
  • num_particles::Int64: Number of belief particles to be used
  • obs_branch::Int64: Branching factor (previous default: 8)
  • num_state::Int64: Number of states to sample from belief (previous default: 500)
  • num_prune_obs::Int64: Number of times to sample observation while pruning alpha edges (previous default: 1000)
  • num_eval_belief::Int64: Number of times to simulate while evaluating belief (previous default: 5000)
  • num_obs::Int64: Number of observations to sample while evaluating belief (previous default: 50)
  • lbound::Any: An object representing the lower bound. The function MCVI.lower_bound(lbound, problem, s) will be called to get the lower bound for the state s - this function needs to be implemented for the solver to work.
  • ubound::Any: An object representing the upper bound. The function MCVI.upper_bound(ubound, problem, s) will be called to get the lower bound for the state s - this function needs to be implemented for the solver to work.

Reference the docs for an example of bounds implemented for the Light Dark problem.

source
+Reward: 5.314410000000001

Documentation

MCVI.MCVISolver — Type
MCVISolver <: POMDPs.Solver

The MCVI solver is a solver for POMDPs that uses Monte Carlo Value Iteration to solve the problem. Described in Bai, H., Hsu, D., & Lee, W. S. (2014). Integrated perception and planning in the continuous space: A POMDP approach. The International Journal of Robotics Research, 33(9), 1288-1302.

Fields

  • simulater::POMDPs.Simulator
  • root::Union{BeliefNode, Nothing}
  • n_iter::Int64: Number of iterations
  • num_particles::Int64: Number of belief particles to be used
  • obs_branch::Int64: Branching factor (previous default: 8)
  • num_state::Int64: Number of states to sample from belief (previous default: 500)
  • num_prune_obs::Int64: Number of times to sample observation while pruning alpha edges (previous default: 1000)
  • num_eval_belief::Int64: Number of times to simulate while evaluating belief (previous default: 5000)
  • num_obs::Int64: Number of observations to sample while evaluating belief (previous default: 50)
  • lbound::Any: An object representing the lower bound. The function MCVI.lower_bound(lbound, problem, s) will be called to get the lower bound for the state s - this function needs to be implemented for the solver to work.
  • ubound::Any: An object representing the upper bound. The function MCVI.upper_bound(ubound, problem, s) will be called to get the lower bound for the state s - this function needs to be implemented for the solver to work.

Reference the docs for an example of bounds implemented for the Light Dark problem.

source
diff --git a/dev/objects.inv b/dev/objects.inv index 8151711..d7eaa25 100644 --- a/dev/objects.inv +++ b/dev/objects.inv @@ -1,5 +1,5 @@ # Sphinx inventory version 2 # Project: MCVI.jl -# Version: 0.3.3 +# Version: 0.3.4 # The remainder of this file is compressed using zlib. xœËÌKI­P(.I±JÉOVÐ5TPðuóär­HÌ-ÈIKä$&¥æ€¤”Ut¹<óŠKsrK2óó°HƒtcvÉO.ÍMÍ+Á§MDç甥)dåX•T¤*@¥¯S1¾ \ No newline at end of file