2022
DOI: 10.1109/lra.2022.3146586
|View full text |Cite
|
Sign up to set email alerts
|

A Shadowcasting-Based Next-Best-View Planner for Autonomous 3D Exploration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 21 publications
(14 citation statements)
references
References 29 publications
0
14
0
Order By: Relevance
“…On the other side, other works select the NBV after evaluating an objective function on a list of randomly chosen candidates in the neighbourhood of the present point. References [44][45][46] use a fitness function which takes into account the potential information gain (measuring the free space around the candidate) and the cost of getting to it from the current location. In the objective function of [47], free space, and information gain (measured image entropy) are taken into account and a penalty is added to points already visited.…”
Section: Nbv Techniquesmentioning
confidence: 99%
See 1 more Smart Citation
“…On the other side, other works select the NBV after evaluating an objective function on a list of randomly chosen candidates in the neighbourhood of the present point. References [44][45][46] use a fitness function which takes into account the potential information gain (measuring the free space around the candidate) and the cost of getting to it from the current location. In the objective function of [47], free space, and information gain (measured image entropy) are taken into account and a penalty is added to points already visited.…”
Section: Nbv Techniquesmentioning
confidence: 99%
“…Equation ( 1) is similar in its external form to [47]. However, while the latter considers free space and potential information gain and penalises visited points, the model presented here considers, for example, [44] and [46], the distance to the candidate. A pseudocode implementation of the function can be found in algorithm 5.…”
Section: System Integration 341 Nbv Selection Based On Image-laser Fu...mentioning
confidence: 99%
“…We consider the environment to be known, either given through a known map or obtained by an exploration or mapping algorithm, i.e. as proposed in [33]. In order to find an obstacle-free path in the environment, we employ the wellknown RRT* algorithm [34], although other path planners can be used as well.…”
Section: A Parabolic Free-fall Trajectorymentioning
confidence: 99%
“…Thereby, a feasible path between the viewpoints is computed, avoiding obstacles and adhering to robot constraints. 8,9 As depicted in Figure 2, the whole coverage path planning procedure can be split up into the five steps: virtual model, preparation of the input model; viewpoint generation, determination of viewpoint candidates; viewpoint selection, removal of unnecessary viewpoint candidates; path planning, ordering of the remaining viewpoints; inspection, the actual measurement process.…”
Section: View Planningmentioning
confidence: 99%
“…Thereby, a feasible path between the viewpoints is computed, avoiding obstacles and adhering to robot constraints. 8,9…”
Section: Introductionmentioning
confidence: 99%