Underwater Cable Localization Method Based on Beetle Swarm Optimization Algorithm

被引:2
|
作者
Huang, Wenchao [1 ]
Pan, Zhijun [1 ]
Xu, Zhezhuang [1 ]
机构
[1] Fuzhou Univ, Coll Elect Engn & Automat, Fuzhou 350108, Peoples R China
基金
中国国家自然科学基金;
关键词
Underwater cables; Location awareness; Magnetic flux density; Sensor arrays; Magnetic fields; Robot sensing systems; Magnetic sensors; TRACKING;
D O I
10.1109/JAS.2022.106073
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Dear Editor, This letter concerns the localization of three-core underwater cables which are widely deployed for offshore energy transmission. It is a non-trivial problem, since the external magnetic field of three-core underwater cables is variable which reduces the accuracy of localization. To solve this problem, in this letter, an approximate equation is firstly derived to formulate the external magnetic field of a three-core armored underwater cable by considering the seafloor environments and the structure of three-core cables. Then, a new underwater cable localization method is proposed based on dual three-axis magnetic sensor array and the beetle swarm optimization (BSO) algorithm. The method constructs a fitness function based on the magnetic flux density amplitude and replaces the existing analytical geometry method with an optimization algorithm to achieve underwater cable localization with higher accuracy.
引用
收藏
页码:1893 / 1895
页数:3
相关论文
共 50 条
  • [21] An Underwater Wideband Sound Source Localization Method Based on Light Neural Network Structure
    Lu, Yi
    Yuan, Yufan
    Liu, Meiyan
    Wei, Yan
    Tu, Xingbin
    Qu, Fengzhong
    IEEE SENSORS JOURNAL, 2024, 24 (13) : 20970 - 20980
  • [22] Cat Swarm Optimization Algorithm: A Survey and Performance Evaluation
    Ahmed, Aram M.
    Rashid, Tarik A.
    Saeed, Soran Ab. M.
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2020, 2020
  • [23] Algorithm Design and Performance Analysis of Target Localization Using Mobile Underwater Acoustic Array Networks
    Su, Ruoyu
    Gong, Zijun
    Li, Cheng
    Shen, Xuemin
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2023, 72 (02) : 2395 - 2406
  • [24] Wi-Fi-Based Indoor Localization With Interval Random Analysis and Improved Particle Swarm Optimization
    Zhang, Xing
    Sun, Wei
    Zheng, Jin
    Lin, Anping
    Liu, Jian
    Ge, Shuzhi Sam
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2024, 23 (10) : 9120 - 9134
  • [25] Control of the CEDRA Brachiation Robot Using Combination of Controlled Lagrangians Method and Particle Swarm Optimization Algorithm
    Tashakori, Shabnam
    Vossoughi, Gholamreza
    Yazdi, Ehsan Azadi
    IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY-TRANSACTIONS OF MECHANICAL ENGINEERING, 2020, 44 (01) : 11 - 21
  • [26] AUV-Aided Localization for Internet of Underwater Things: A Reinforcement-Learning-Based Method
    Yan, Jing
    Gong, Yadi
    Chen, Cailian
    Luo, Xiaoyuan
    Guan, Xinping
    IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (10): : 9728 - 9746
  • [27] A Novel Magnetic Spiral Capsule Endoscope Localization Method Based on an Improved Artificial Bee Colony Algorithm
    Ye, Bo
    Hu, Jinping
    Zha, Wei
    Wang, Bo
    Gao, Qiyuan
    Fang, Guo
    Dwivedi, Amit Krishna
    Liu, Sheng
    IEEE SENSORS JOURNAL, 2024, 24 (02) : 1740 - 1750
  • [28] Three-dimensional path planning for autonomous underwater vehicles based on a whale optimization algorithm
    Yan, Zheping
    Zhang, Jinzhong
    Zeng, Jia
    Tang, Jialing
    OCEAN ENGINEERING, 2022, 250
  • [29] Source localization in dynamic indoor environments with natural ventilation: An experimental study of a particle swarm optimization-based multi-robot olfaction method
    Feng, Qilin
    Zhang, Canxin
    Lu, Jingyu
    Cai, Hao
    Chen, Zhilong
    Yang, Yibin
    Li, Fei
    Li, Xianting
    BUILDING AND ENVIRONMENT, 2019, 161
  • [30] Face and iris localization using templates designed by particle swarm optimization
    Perez, Claudio A.
    Aravena, Carlos M.
    Vallejos, Juan I.
    Estevez, Pablo A.
    Held, Claudio M.
    PATTERN RECOGNITION LETTERS, 2010, 31 (09) : 857 - 868