2022
DOI: 10.1007/978-3-031-21065-5_17
|View full text |Cite
|
Sign up to set email alerts
|

ExplORB-SLAM: Active Visual SLAM Exploiting the Pose-graph Topology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 14 publications
0
7
0
Order By: Relevance
“…Similar to information-entropy-based methods, the Theory of Optimal Experimental Design (TOED) can also be used to account for the utility of performing the active mapping action, and each action is considered as a stochastic design, while comparisons among designs are made using their associated covariance matrices via the optimality criteria, including A-opt, D-opt, and E-opt. The work in [19,20] discussed the general relationship between optimality criteria and connectivity indices when using TOED for active Graph-SLAM.…”
Section: Information-entropy-based Methodsmentioning
confidence: 99%
“…Similar to information-entropy-based methods, the Theory of Optimal Experimental Design (TOED) can also be used to account for the utility of performing the active mapping action, and each action is considered as a stochastic design, while comparisons among designs are made using their associated covariance matrices via the optimality criteria, including A-opt, D-opt, and E-opt. The work in [19,20] discussed the general relationship between optimality criteria and connectivity indices when using TOED for active Graph-SLAM.…”
Section: Information-entropy-based Methodsmentioning
confidence: 99%
“…This environment did not involve any obstacle avoidance tasks; therefore, there was no need to employ a SLAM method. Juna et al presented an open-source Active SLAM framework that leverages the Graph SLAM system [28]. The framework uses fast utility computation by exploiting and implementing path planning through DQN.…”
Section: Of 19mentioning
confidence: 99%
“…Table 1 summarizes the differences between our approach and other mentioned methods. [21] EKF SLAM A* -√ -Placed et al [22] Open Karto Dijkstra -√ -Suresh et al [23] Graph SLAM RRT 2 -√ -Chen et al [27] -DQN 3 ,GNN 4 T-opt √ -Juna et al [28] Graph SLAM DQN D-opt √ -Castellanos et al [29] Gmapping D3QN √ √…”
Section: Of 19mentioning
confidence: 99%
“…Placed and Castellanos [81], [160] study the general active graph-SLAM problem formulated over the Lie group SE(n); showing the existing relationships between modern optimality criteria of the FIM and connectivity indices when the edges of the posegraph are weighted appropriately, and reporting substantial reductions in computation time. These results have been used in coverage problems [62], multi-robot exploration [128], active visual SLAM [66], or to develop a stopping criterion [161].…”
Section: The Graphical Structure Of the Problemmentioning
confidence: 99%