- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
During a sequence of actions, a robot needs to make a decision at every node about which actions to take. The previous approach is to first simulate and see what is likely to happen after each action. But this is equivalent to exhaustive search, which leads to very large time and compute costs. The authors propose a method that uses the difference in these future possibilities to judge whether it is worth investing more resources in search. They compare with some other methods for deciding whether to search, and the results are reasonably good.
Critical strengths
- The problem they focus on is important. When a robot handles a task through a sequence of actions, search is indeed needed to achieve better results, but the cost of search is high. They use a pruning-like approach to reduce the scope of search. 2. The methods they compare with are fairly sufficient and fairly numerous.
Critical weaknesses
- Their main tests are all conducted in simulation environments, which makes them rather dependent on the simulation environment. Could validation be done in multiple simulation environments at the same time? What I mean is testing with different physics engines. Because each simulator may have its own deviation from the real world, and this deviation may lead to wrong results regarding actual success or failure. 2. This idea is not completely novel. Moreover, regarding how these evaluation values are computed (why these evaluation values are computed this way), I would like to see more ablations.
Questions for authors
Same as Weaknesses.
Dear reviewers,
Thank you for your work reviewing this paper!
The authors have submitted their responses. If you haven't already, please acknowledge them in a comment and adjust your reviews as needed. The discussion period finishes on November 18.
Best regards, Area Chair