Abstract
During long-term operation graph-based SLAM methods suffer from unbounded growth of the pose graph and computational cost. To limit the graph size, various methods to reduce the graph have been studied in the past. In this paper we propose a criterion to reject poses, based on the difference between expected and real scan of the candidate. The performance of this reduction method is then evaluated in terms of error and computation time.
| Original language | English |
|---|---|
| Title of host publication | 2017 56th Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2017 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 644-647 |
| Number of pages | 4 |
| Volume | 2017-November |
| ISBN (Electronic) | 9784907764579 |
| DOIs | |
| Publication status | Published - 2017 Nov 10 |
| Event | 56th Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2017 - Kanazawa, Japan Duration: 2017 Sep 19 → 2017 Sep 22 |
Other
| Other | 56th Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2017 |
|---|---|
| Country | Japan |
| City | Kanazawa |
| Period | 17/9/19 → 17/9/22 |
Fingerprint
Keywords
- Pose-graph reduction
- SLAM
ASJC Scopus subject areas
- Computer Science Applications
- Control and Optimization
- Control and Systems Engineering
- Instrumentation
Cite this
Performance evaluation of graph-reduction in SLAM through pose rejection. / Cervantes, Pablo; Inoue, Masaki.
2017 56th Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2017. Vol. 2017-November Institute of Electrical and Electronics Engineers Inc., 2017. p. 644-647.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Performance evaluation of graph-reduction in SLAM through pose rejection
AU - Cervantes, Pablo
AU - Inoue, Masaki
PY - 2017/11/10
Y1 - 2017/11/10
N2 - During long-term operation graph-based SLAM methods suffer from unbounded growth of the pose graph and computational cost. To limit the graph size, various methods to reduce the graph have been studied in the past. In this paper we propose a criterion to reject poses, based on the difference between expected and real scan of the candidate. The performance of this reduction method is then evaluated in terms of error and computation time.
AB - During long-term operation graph-based SLAM methods suffer from unbounded growth of the pose graph and computational cost. To limit the graph size, various methods to reduce the graph have been studied in the past. In this paper we propose a criterion to reject poses, based on the difference between expected and real scan of the candidate. The performance of this reduction method is then evaluated in terms of error and computation time.
KW - Pose-graph reduction
KW - SLAM
UR - http://www.scopus.com/inward/record.url?scp=85044120371&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85044120371&partnerID=8YFLogxK
U2 - 10.23919/SICE.2017.8105681
DO - 10.23919/SICE.2017.8105681
M3 - Conference contribution
AN - SCOPUS:85044120371
VL - 2017-November
SP - 644
EP - 647
BT - 2017 56th Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2017
PB - Institute of Electrical and Electronics Engineers Inc.
ER -