Map-matching algorithms for robot self-localization: a comparison between perfect match, iterative closest point and normal distributions transform
The self-localization of mobile robots is one of the most fundamental problems in the robotics navigation eld. It is a complex and challenging issue due to the hard requirements that autonomous mobile vehicles are subject to, particularly with regard to the algorithms accuracy, robustness and comput...
| Autor principal: | |
|---|---|
| Outros Autores: | , , , , , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2018
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10198/16260 |
| País: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/16260 |