Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Line 22: src/ProgressiveWidening.jl #3

Open
himanshugupta1009 opened this issue Nov 17, 2023 · 2 comments
Open

Line 22: src/ProgressiveWidening.jl #3

himanshugupta1009 opened this issue Nov 17, 2023 · 2 comments

Comments

@himanshugupta1009
Copy link

himanshugupta1009 commented Nov 17, 2023

This seems incomplete. Shouldn't we keep sampling an action either until all the actions have been already added or you find an action that has not been added? Here it seems to only check one sampled action and if this action already exists, it doesn't add anything instead of looking for another action that has not already been added.

@WhiffleFish
Copy link
Owner

Nah, your proposed method would require a rejection sampling loop that could get stuck for an unpredictable amount of time. This would especially be the case for large discrete action spaces paired with similarly large $k_a$.

The current method for progressive action sampling is also employed by other JuliaPOMDP solvers like POMCPOW and MCTS. While it may not be perfect, it is simple, has a predictable runtime, and yields strong performance in benchmarks.

@WhiffleFish
Copy link
Owner

Granted, it may also be worthwhile admitting a custom action sampler as an option to the solver.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants