arrow
返回

Hybrid Memetic Algorithm for the Node Location Problem in Local Positioning Systems

delete2020-09-24
delete19
delete
OA
AI
J
Javier Díez-González *
P
Paula Verde
R
Rubén Ferrero-Guillén
R
Rubén Álvarez
H
Hilde Pérez
DOI:10.3390/s20195475delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Local Positioning Systems (LPS) have shown excellent performance for applications that demand high accuracy. They rely on ad-hoc node deployments which fit the environment characteristics in order to reduce the system uncertainties. The obtainment of competitive results through these systems requires the solution of the Node Location Problem (finding the optimal cartesian coordinates of the architecture sensors). This problem has been assigned as NP-Hard, therefore a heuristic solution is recommended for addressing this complex problem. Genetic Algorithms (GA) have shown an excellent trade-off between diversification and intensification in the literature. However, in Non-Line-of-Sight (NLOS) environments in which there is not continuity in the fitness function evaluation of a particular node distribution among contiguous solutions, challenges arise for the GA during the exploration of new potential regions of the space of solutions. Consequently, in this paper, we first propose a Hybrid GA with a combination of the GA operators in the evolutionary process for the Node Location Problem. Later, we introduce a Memetic Algorithm (MA) with a Local Search (LS) strategy for exploring the most different individuals of the population in search of improving the previous results. Finally, we combine the Hybrid Genetic Algorithm (HGA) and Memetic Algorithm (MA), designing an enhanced novel methodology for solving the Node Location Problem, a Hybrid Memetic Algorithm (HMA). Results show that the HMA proposed in this article outperforms all of the individual configurations presented and attains an improvement of 14.2% in accuracy for the Node Location Problem solution in the scenario of simulations with regards to the previous GA optimizations of the literature.
Keyword:
clock errors
Cramé r– Rao bound
genetic algorithm
hybrid genetic algorithm
local positioning systems
memetic algorithm
node location problem
noise uncertainties
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Sensors 封面图
Sensors
IF:
3.5
论文数:
7.2W
被引数:
20.9W

机构

U
universidad de leon
学者数:
4.9K
论文数: 3.8K
被引数: 3
引用论文

引用论文

3D Tdoa Problem Solution with Four ReceivingNodes
errSENSORS
IF3.5
err2019-06-29
err37
errOAAI
errDiez-Gonzalez, Javier; Alvarez, Ruben; Sanchez-Gonzalez, Lidia; Fernandez-Robles, Laura; Perez, Hilde; Castejon-Limas, Manuel
err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
Prevention and Recovery in Early Psychosis (PREP®): Building a public-academic partnership program in Massachusetts, United States
err2013-04-01
err0
PREAI
errBrina Caplan; Suzanna V. Zimmet; Eric C. Meyer; Michelle Friedman-Yakoobian; Thomas Monteleone; Y. Jude Leung; Margaret E. Guyer; Laura Logue Rood; Matcheri S. Keshavan; Larry J. Seidman
err分享
err收藏
Present State of the Chemistry of Technetium
err2007-10-17
err0
PREAI
errV I Spitsyn; A F Kuzina; A A Oblova
err分享
err收藏
学者 查看更多内容