2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2022
DOI: 10.1109/iros47612.2022.9981713
|View full text |Cite
|
Sign up to set email alerts
|

Online Planning for Interactive-POMDPs using Nested Monte Carlo Tree Search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…where đťś‚ is a normalizing constant. POMDPs can be solved by many algorithms, such as Grid-based algorithms [72], Monte Carlo tree search [134]. However, due to its partial observability of the environment, POMDPs are more challenging to solve than MDPs.…”
Section: Reinforcement Learning Methodsmentioning
confidence: 99%
“…where đťś‚ is a normalizing constant. POMDPs can be solved by many algorithms, such as Grid-based algorithms [72], Monte Carlo tree search [134]. However, due to its partial observability of the environment, POMDPs are more challenging to solve than MDPs.…”
Section: Reinforcement Learning Methodsmentioning
confidence: 99%