arrow
返回

Optimal sensor placement based on relaxation sequential algorithm

delete2019-06-01
delete18
PRE
AI
H
Hong Yin
K
Kangli Dong
P
Pan, An
Z
Zhenrui Peng *
J
Jiang Zhao-yuan
S
Shaoyuan Li
DOI:10.1016/j.neucom.2018.03.088delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Aiming at the large tension of the solution obtained by sequential algorithm for optimal sensor placement problem, a novel relaxation sequential algorithm is proposed by introducing the idea of edge relaxation operation of Dijkstra's algorithm into sequential algorithm. An initial solution set is generated by sequential algorithm, and improved by relaxation till the relaxation operation terminates. The proposed algorithm takes modal assurance criterion (MAC) matrix as the objective fitness function. A truss structure and a rigid-framed arch bridge are applied as examples to verify the effectiveness of the new algorithm for optimal sensor placement. The result indicates that the relaxation sequential algorithm requires fewer sensors and can reach better maximum off-diagonal element of MAC matrix in OSP problem. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Relaxation sequential algorithm
Optimal sensor placement
Modal assurance criterion
AI总结

AI总结

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

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

S
shanghai jiao tong university
学者数:
15.7W
论文数: 11.7W
被引数: 159
L
Lanzhou Jiaotong University
学者数:
6.3K
论文数: 3.6K
被引数: 4.2K
引用论文

引用论文

Some new mixed A-site chromium chalcogenide spinels
err1970-06-01
err0
PREAI
errH.L. Pinch; M.J. Woods; E. Lopatin
err分享
err收藏
err分享
err收藏
学者 查看更多内容