2013
DOI: 10.1007/s10846-013-9981-9
|View full text |Cite
|
Sign up to set email alerts
|

Active SLAM and Exploration with Particle Filters Using Kullback-Leibler Divergence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
67
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 86 publications
(67 citation statements)
references
References 20 publications
0
67
0
Order By: Relevance
“…A popular framework for active SLAM consists of selecting the best future action among a finite set of alternatives. This family of active SLAM algorithms proceeds in three main steps [15,35]: 1) The robot identifies possible locations to explore or exploit, i.e. vantage locations, in its current estimate of the map; 2) The robot computes the utility of visiting each vantage point and selects the action with the highest utility; and 3) The robot carries out the selected action and decides if it is necessary to continue or to terminate the task.…”
Section: Active Slammentioning
confidence: 99%
See 1 more Smart Citation
“…A popular framework for active SLAM consists of selecting the best future action among a finite set of alternatives. This family of active SLAM algorithms proceeds in three main steps [15,35]: 1) The robot identifies possible locations to explore or exploit, i.e. vantage locations, in its current estimate of the map; 2) The robot computes the utility of visiting each vantage point and selects the action with the highest utility; and 3) The robot carries out the selected action and decides if it is necessary to continue or to terminate the task.…”
Section: Active Slammentioning
confidence: 99%
“…If such posterior were known, an information-theoretic function, as the information gain, could be used to rank the different actions [22,233]. However, computing this joint probability analytically is, in general, computationally intractable [35,76,233]. In practice, one resorts to approximations.…”
Section: Active Slammentioning
confidence: 99%
“…There are several works that perform active SLAM with sensors such as lasers for 2D/3D mapping [27], [28], [29], but Davison and Murray were the first who integrated motion with stereo visual SLAM [30] where their objective was to minimize the trajectory error. Most active SLAM algorithms are based on maximizing mutual information [8], [31], which is also referred to as maximizing information gain [32], [33].…”
Section: Active Slam With Information Divergencementioning
confidence: 99%
“…Recent works in this area are focused on designing an on-line algorithm that estimates current position and previous results and sets goal point in order to maximize the map coverage and accuracy [5]- [7]. Some of recently proposed techniques include methods based on Kullback-Leibler divergence for evaluating the SLAM posterior approximations [7]; hierarchical Bayesian approach to determine what area should be visited next [6]; model predictive control and using an attractor to incorporate long term goals [8]; actively closing loops that are made during the exploration [5].…”
Section: Introductionmentioning
confidence: 99%
“…Some of recently proposed techniques include methods based on Kullback-Leibler divergence for evaluating the SLAM posterior approximations [7]; hierarchical Bayesian approach to determine what area should be visited next [6]; model predictive control and using an attractor to incorporate long term goals [8]; actively closing loops that are made during the exploration [5].…”
Section: Introductionmentioning
confidence: 99%