Cargando…
A Revisiting Method Using a Covariance Traveling Salesman Problem Algorithm for Landmark-Based Simultaneous Localization and Mapping
This paper presents an efficient revisiting algorithm for landmark-based simultaneous localization and mapping (SLAM). To reduce SLAM uncertainty in terms of a robot’s pose and landmark positions, the method autonomously evaluates valuable landmarks for the data associations in the SLAM algorithm an...
Autor principal: | Ryu, Hyejeong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6891320/ https://www.ncbi.nlm.nih.gov/pubmed/31717671 http://dx.doi.org/10.3390/s19224910 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
por: Sung, Jinmo, et al.
Publicado: (2014) -
List-Based Simulated Annealing Algorithm for Traveling Salesman Problem
por: Zhan, Shi-hua, et al.
Publicado: (2016) -
The traveling salesman problem and its variations
por: Gutin, Gregory, et al.
Publicado: (2007) -
The multi-stripe travelling salesman problem
por: Çela, Eranda, et al.
Publicado: (2017)