.png){kind=icon}
返回
A dynamic state transition algorithm with application to sensor network localization
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2017.08.010.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The sensor network localization (SNL) problem aims to reconstruct the positions of all the sensors in a network with given distance between pairs of sensors and within the radio range between them. It is proved that the computational complexity of the SNL problem is NP-hard, and semi-definite programming or second-order cone programming relaxation methods can only solve some special problems of this kind. In this study, a stochastic intelligent optimization method based on the state transition algorithm is introduced to solve the SNL problem without additional assumptions and conditions on the problem structure. To transcend local optimality, a novel dynamic adjustment strategy called risk and restoration in probability is incorporated into the state transition algorithm. An empirical study is investigated to appropriately choose the risk probability and restoration probability, yielding the dynamic state transition algorithm, which is further improved with gradient-based refinement. The refined dynamic state transition algorithm is applied to the SNL problem, and satisfactory simulation results show the effectiveness of the proposed approach. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
State transition algorithm
Dynamic adjustment
Sensor network localization
Global optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Insurer and out‐of‐pocket costs of osteoarthritis in the US: Evidence from national survey data
PREAI
分享收藏
Discrete state transition algorithm for unconstrained integer optimization problems.png)
NEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏
查看更多内容