Cargando…

A Novel Real-Time Reference Key Frame Scan Matching Method

Unmanned aerial vehicles represent an effective technology for indoor search and rescue operations. Typically, most indoor missions’ environments would be unknown, unstructured, and/or dynamic. Navigation of UAVs in such environments is addressed by simultaneous localization and mapping approach usi...

Descripción completa

Detalles Bibliográficos
Autores principales: Mohamed, Haytham, Moussa, Adel, Elhabiby, Mohamed, El-Sheimy, Naser, Sesay, Abu
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5469665/
https://www.ncbi.nlm.nih.gov/pubmed/28481285
http://dx.doi.org/10.3390/s17051060
_version_ 1783243622205882368
author Mohamed, Haytham
Moussa, Adel
Elhabiby, Mohamed
El-Sheimy, Naser
Sesay, Abu
author_facet Mohamed, Haytham
Moussa, Adel
Elhabiby, Mohamed
El-Sheimy, Naser
Sesay, Abu
author_sort Mohamed, Haytham
collection PubMed
description Unmanned aerial vehicles represent an effective technology for indoor search and rescue operations. Typically, most indoor missions’ environments would be unknown, unstructured, and/or dynamic. Navigation of UAVs in such environments is addressed by simultaneous localization and mapping approach using either local or global approaches. Both approaches suffer from accumulated errors and high processing time due to the iterative nature of the scan matching method. Moreover, point-to-point scan matching is prone to outlier association processes. This paper proposes a low-cost novel method for 2D real-time scan matching based on a reference key frame (RKF). RKF is a hybrid scan matching technique comprised of feature-to-feature and point-to-point approaches. This algorithm aims at mitigating errors accumulation using the key frame technique, which is inspired from video streaming broadcast process. The algorithm depends on the iterative closest point algorithm during the lack of linear features which is typically exhibited in unstructured environments. The algorithm switches back to the RKF once linear features are detected. To validate and evaluate the algorithm, the mapping performance and time consumption are compared with various algorithms in static and dynamic environments. The performance of the algorithm exhibits promising navigational, mapping results and very short computational time, that indicates the potential use of the new algorithm with real-time systems.
format Online
Article
Text
id pubmed-5469665
institution National Center for Biotechnology Information
language English
publishDate 2017
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-54696652017-06-16 A Novel Real-Time Reference Key Frame Scan Matching Method Mohamed, Haytham Moussa, Adel Elhabiby, Mohamed El-Sheimy, Naser Sesay, Abu Sensors (Basel) Article Unmanned aerial vehicles represent an effective technology for indoor search and rescue operations. Typically, most indoor missions’ environments would be unknown, unstructured, and/or dynamic. Navigation of UAVs in such environments is addressed by simultaneous localization and mapping approach using either local or global approaches. Both approaches suffer from accumulated errors and high processing time due to the iterative nature of the scan matching method. Moreover, point-to-point scan matching is prone to outlier association processes. This paper proposes a low-cost novel method for 2D real-time scan matching based on a reference key frame (RKF). RKF is a hybrid scan matching technique comprised of feature-to-feature and point-to-point approaches. This algorithm aims at mitigating errors accumulation using the key frame technique, which is inspired from video streaming broadcast process. The algorithm depends on the iterative closest point algorithm during the lack of linear features which is typically exhibited in unstructured environments. The algorithm switches back to the RKF once linear features are detected. To validate and evaluate the algorithm, the mapping performance and time consumption are compared with various algorithms in static and dynamic environments. The performance of the algorithm exhibits promising navigational, mapping results and very short computational time, that indicates the potential use of the new algorithm with real-time systems. MDPI 2017-05-07 /pmc/articles/PMC5469665/ /pubmed/28481285 http://dx.doi.org/10.3390/s17051060 Text en © 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Mohamed, Haytham
Moussa, Adel
Elhabiby, Mohamed
El-Sheimy, Naser
Sesay, Abu
A Novel Real-Time Reference Key Frame Scan Matching Method
title A Novel Real-Time Reference Key Frame Scan Matching Method
title_full A Novel Real-Time Reference Key Frame Scan Matching Method
title_fullStr A Novel Real-Time Reference Key Frame Scan Matching Method
title_full_unstemmed A Novel Real-Time Reference Key Frame Scan Matching Method
title_short A Novel Real-Time Reference Key Frame Scan Matching Method
title_sort novel real-time reference key frame scan matching method
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5469665/
https://www.ncbi.nlm.nih.gov/pubmed/28481285
http://dx.doi.org/10.3390/s17051060
work_keys_str_mv AT mohamedhaytham anovelrealtimereferencekeyframescanmatchingmethod
AT moussaadel anovelrealtimereferencekeyframescanmatchingmethod
AT elhabibymohamed anovelrealtimereferencekeyframescanmatchingmethod
AT elsheimynaser anovelrealtimereferencekeyframescanmatchingmethod
AT sesayabu anovelrealtimereferencekeyframescanmatchingmethod
AT mohamedhaytham novelrealtimereferencekeyframescanmatchingmethod
AT moussaadel novelrealtimereferencekeyframescanmatchingmethod
AT elhabibymohamed novelrealtimereferencekeyframescanmatchingmethod
AT elsheimynaser novelrealtimereferencekeyframescanmatchingmethod
AT sesayabu novelrealtimereferencekeyframescanmatchingmethod