Commit 10d81df4 authored by Nada Beili's avatar Nada Beili
Browse files

Update README.md

parent 1b4bc325
# next_best_view_rl
This project is an extension to work presented in this [repository](https://gitlab.uni-koblenz.de/ckorbach/next_best_view_rl). The project aims to find the sequence of next-best-views of occluded and self-occluded objects using reinforcement learning algorithms: PPO, SAC, TD3, and A2C. We trained each algorithm separately on three different datasets, extracted from [TEOS dataset](https://data.nvision.eecs.yorku.ca/TEOS/), for five runs using random seed. We compared the performance of the algorithms during training and evaluation. We could find that SAC outperforms all the other algorithms.
# next_best_view_rl_benchmark
This project is an extension to the work presented in this [repository](https://gitlab.uni-koblenz.de/ckorbach/next_best_view_rl). The project aims to find the sequence of next-best-views of occluded and self-occluded objects using reinforcement learning algorithms: PPO, SAC, TD3, and A2C. We trained each algorithm separately on three different datasets, extracted from [TEOS dataset](https://data.nvision.eecs.yorku.ca/TEOS/), for five runs using random seed. We compared the performance of the algorithms during training and evaluation. We could find that SAC outperforms all the other algorithms.
# Setup
1. Clone the repository: `git clone ...`
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment