build based on f369ddd

dev/.documenter-siteinfo.json

@@ -1 +1 @@
-{"documenter":{"julia_version":"1.10.4","generation_timestamp":"2024-06-14T14:21:42","documenter_version":"1.4.1"}}
+{"documenter":{"julia_version":"1.10.4","generation_timestamp":"2024-06-14T14:35:27","documenter_version":"1.4.1"}}

dev/index.html

@@ -44,4 +44,4 @@
 Solving...
 Gap closed!
 Solved!
-Reward: 5.314410000000001</code></pre><h2 id="Documentation"><a class="docs-heading-anchor" href="#Documentation">Documentation</a><a id="Documentation-1"></a><a class="docs-heading-anchor-permalink" href="#Documentation" title="Permalink"></a></h2><article class="docstring"><header><a class="docstring-article-toggle-button fa-solid fa-chevron-down" href="javascript:;" title="Collapse docstring"></a><a class="docstring-binding" id="MCVI.MCVISolver" href="#MCVI.MCVISolver"><code>MCVI.MCVISolver</code></a> — <span class="docstring-category">Type</span></header><section><div><pre><code class="language-julia hljs">MCVISolver &lt;: POMDPs.Solver</code></pre><p>The MCVI solver is a solver for POMDPs that uses Monte Carlo Value Iteration to solve the problem.      Described in Bai, H., Hsu, D., &amp; Lee, W. S. (2014). Integrated perception and planning in the continuous space: A POMDP approach. <em>The International Journal of Robotics Research</em>, 33(9), 1288-1302.</p><p><strong>Fields</strong></p><ul><li><code>simulater::POMDPs.Simulator</code></li><li><code>root::Union{BeliefNode, Nothing}</code></li><li><code>n_iter::Int64</code>: Number of iterations</li><li><code>num_particles::Int64</code>: Number of belief particles to be used</li><li><code>obs_branch::Int64</code>: Branching factor (previous default: 8)</li><li><code>num_state::Int64</code>: Number of states to sample from belief (previous default: 500)</li><li><code>num_prune_obs::Int64</code>: Number of times to sample observation while pruning alpha edges (previous default: 1000)</li><li><code>num_eval_belief::Int64</code>: Number of times to simulate while evaluating belief (previous default: 5000)</li><li><code>num_obs::Int64</code>: Number of observations to sample while evaluating belief (previous default: 50)</li><li><code>lbound::Any</code>: An object representing the lower bound. The function <code>MCVI.lower_bound(lbound, problem, s)</code> will be called to get the lower bound for the state <code>s</code> - this function needs to be implemented for the solver to work.</li><li><code>ubound::Any</code>: An object representing the upper bound. The function <code>MCVI.upper_bound(ubound, problem, s)</code> will be called to get the lower bound for the state <code>s</code> - this function needs to be implemented for the solver to work.</li></ul><p>Reference the docs for an example of bounds implemented for the Light Dark problem.</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaPOMDP/MCVI.jl/blob/62624d866983dd3c3749ce912bc8f9140b755787/src/solver.jl#L24-L44">source</a></section></article></article><nav class="docs-footer"><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.4.1 on <span class="colophon-date" title="Friday 14 June 2024 14:21">Friday 14 June 2024</span>. Using Julia version 1.10.4.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
+Reward: 5.314410000000001</code></pre><h2 id="Documentation"><a class="docs-heading-anchor" href="#Documentation">Documentation</a><a id="Documentation-1"></a><a class="docs-heading-anchor-permalink" href="#Documentation" title="Permalink"></a></h2><article class="docstring"><header><a class="docstring-article-toggle-button fa-solid fa-chevron-down" href="javascript:;" title="Collapse docstring"></a><a class="docstring-binding" id="MCVI.MCVISolver" href="#MCVI.MCVISolver"><code>MCVI.MCVISolver</code></a> — <span class="docstring-category">Type</span></header><section><div><pre><code class="language-julia hljs">MCVISolver &lt;: POMDPs.Solver</code></pre><p>The MCVI solver is a solver for POMDPs that uses Monte Carlo Value Iteration to solve the problem.      Described in Bai, H., Hsu, D., &amp; Lee, W. S. (2014). Integrated perception and planning in the continuous space: A POMDP approach. <em>The International Journal of Robotics Research</em>, 33(9), 1288-1302.</p><p><strong>Fields</strong></p><ul><li><code>simulater::POMDPs.Simulator</code></li><li><code>root::Union{BeliefNode, Nothing}</code></li><li><code>n_iter::Int64</code>: Number of iterations</li><li><code>num_particles::Int64</code>: Number of belief particles to be used</li><li><code>obs_branch::Int64</code>: Branching factor (previous default: 8)</li><li><code>num_state::Int64</code>: Number of states to sample from belief (previous default: 500)</li><li><code>num_prune_obs::Int64</code>: Number of times to sample observation while pruning alpha edges (previous default: 1000)</li><li><code>num_eval_belief::Int64</code>: Number of times to simulate while evaluating belief (previous default: 5000)</li><li><code>num_obs::Int64</code>: Number of observations to sample while evaluating belief (previous default: 50)</li><li><code>lbound::Any</code>: An object representing the lower bound. The function <code>MCVI.lower_bound(lbound, problem, s)</code> will be called to get the lower bound for the state <code>s</code> - this function needs to be implemented for the solver to work.</li><li><code>ubound::Any</code>: An object representing the upper bound. The function <code>MCVI.upper_bound(ubound, problem, s)</code> will be called to get the lower bound for the state <code>s</code> - this function needs to be implemented for the solver to work.</li></ul><p>Reference the docs for an example of bounds implemented for the Light Dark problem.</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaPOMDP/MCVI.jl/blob/f369ddd682c9d827743449c6d0d3764c3943869c/src/solver.jl#L24-L44">source</a></section></article></article><nav class="docs-footer"><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.4.1 on <span class="colophon-date" title="Friday 14 June 2024 14:35">Friday 14 June 2024</span>. Using Julia version 1.10.4.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>

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�