2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 2017
DOI: 10.1109/cvpr.2017.541
|View full text |Cite
|
Sign up to set email alerts
|

A Reinforcement Learning Approach to the View Planning Problem

Abstract: We present a Reinforcement Learning (RL) solution to the view planning problem (VPP), which generates a sequence of view points that are capable of sensing all accessible area of a given object represented as a 3D model. In doing so, the goal is to minimize the number of view points, making the VPP a class of set covering optimization problem (SCOP). The SCOP is N P -hard, and the inapproximability results tell us that the greedy algorithm provides the best approximation that runs in polynomial time. In order … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(32 citation statements)
references
References 29 publications
0
32
0
Order By: Relevance
“…The most widely used categorisation [25] classifies approaches as either scene-model-based or scene-model-free. Model-based approaches [1,2] require an a priori scene model and do not generalise well. Within the class of model-free approaches there are global, volumetric and surface representations.…”
Section: Related Workmentioning
confidence: 99%
“…The most widely used categorisation [25] classifies approaches as either scene-model-based or scene-model-free. Model-based approaches [1,2] require an a priori scene model and do not generalise well. Within the class of model-free approaches there are global, volumetric and surface representations.…”
Section: Related Workmentioning
confidence: 99%
“…In addition to lattice-like structures for view poses, we also evaluate a random sampling of view poses as done by [ 11 , 13 ]. Therefore, we use the previously defined limits and to construct a box.…”
Section: Proposed Architecture (Methods)mentioning
confidence: 99%
“…[ 9 ] proposed an evolutionary search algorithm and [ 10 ] applied linear programming to solve the VPP. As outlined by [ 11 ], these methods lack performance gains and efficiency over simple greedy algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…With the rise of deep learning, active vision problems has also been tackled through learning-based approaches. The problem has been cast as a set covering optimization problem in which a reinforcement learning agent has to select the least amount of views to observe the area (Devrim Kaba et al, 2017). This approach assumes that the area is known in advance, and that an agent can be trained on this.…”
Section: Related Workmentioning
confidence: 99%