| Speeding up POMDP planning via simplification O Sztyglic, V Indelman 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems …, 2022 | 11 | 2022 |
| Simplified belief-dependent reward mcts planning with guaranteed tree consistency O Sztyglic, A Zhitnikov, V Indelman arXiv preprint arXiv:2105.14239, 2021 | 7 | 2021 |
| Online pomdp planning via simplification O Sztyglic, V Indelman arXiv preprint arXiv:2105.05296, 2021 | 6 | 2021 |
| No compromise in solution quality: Speeding up belief-dependent continuous POMDPs via adaptive multilevel simplification A Zhitnikov, O Sztyglic, V Indelman arXiv preprint arXiv:2310.10274, 2023 | 4 | 2023 |
| Speeding up pomdp planning via simplification-supplementary material O Sztyglic, V Indelman Technion-Israel Institute of Technology, Tech. Rep., 2022 | 1 | 2022 |
| No compromise in solution quality: Speeding up belief-dependent continuous partially observable Markov decision processes via adaptive multilevel simplification A Zhitnikov, O Sztyglic, V Indelman The International Journal of Robotics Research, 02783649241261398, 2024 | | 2024 |
| Online Partially Observable Markov Decision Process Planning via Simplification O Sztyglic, V Indelman Computer Science Department, Technion, 2021 | | 2021 |
