2013 IEEE International Conference on Robotics and Automation 2013
DOI: 10.1109/icra.2013.6630745
|View full text |Cite
|
Sign up to set email alerts
|

Efficient neighbourhood-based information gain approach for exploration of complex 3D environments

Abstract: This paper presents an approach for exploring a complex 3D environment with a sensor mounted on the end effector of a robot manipulator. In contrast to many current approaches which plan as far ahead as possible using as much environment information as is available, our approach considers only a small set of poses (vector of joint angles) neighbouring the robot's current pose in configuration space. Our approach is compared to an existing exploration strategy for a similar robot. Our results demonstrate a sign… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
20
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
3
3

Relationship

3
7

Authors

Journals

citations
Cited by 31 publications
(21 citation statements)
references
References 10 publications
1
20
0
Order By: Relevance
“…In [13] a greedy approach was adopted which maximised the information gain for the entire set of poses, however this was found to be inefficient, especially when (as is the case in this application) the robot base is mobile and the robot's DOF count is increased. Alternatively, the nearest neighbour could be selected by analysing the pose set and moving to the nearest pose in configuration space (C-space) [17]. Randomly selecting a safe pose from the set would require no gain calculations but can be expected to be inefficient since it is undirected.…”
Section: Methodsmentioning
confidence: 99%
“…In [13] a greedy approach was adopted which maximised the information gain for the entire set of poses, however this was found to be inefficient, especially when (as is the case in this application) the robot base is mobile and the robot's DOF count is increased. Alternatively, the nearest neighbour could be selected by analysing the pose set and moving to the nearest pose in configuration space (C-space) [17]. Randomly selecting a safe pose from the set would require no gain calculations but can be expected to be inefficient since it is undirected.…”
Section: Methodsmentioning
confidence: 99%
“…These views are re-evaluated using the convolution of two functions: the utility function and a Gaussian function that accounts for the positioning errors. A new exploration algorithm called nearest neighbour NBV (NN-NBV) was presented in the study by Quin et al, 29 which reduces the number of evaluated viewpoints considering the closest viewpoints in the configuration space. It also reduces the number of gain calculations, overall computations and the time required to perform the exploration.…”
Section: Exploratory-based Viewpoint Generationmentioning
confidence: 99%
“…It then details the formulation of the objective functions before presenting a pose optimisation nearest neighbour algorithm. Section III presents experimental results using data collected both in our laboratory and on-site, comparing the new approach to alternative approaches [5], [7], [11]. Section IV discusses the limitations and possible drawbacks to the approach.…”
Section: Introductionmentioning
confidence: 99%