基于层次强化学习的不确定环境下海洋传感器网络移动信标逻辑神经路径规划

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Weijun Wang;Huafeng Wu;Shenhua Yang;Xiaojun Mei;Dezhi Han;Mario D. Marino;Kuan-Ching Li
{"title":"基于层次强化学习的不确定环境下海洋传感器网络移动信标逻辑神经路径规划","authors":"Weijun Wang;Huafeng Wu;Shenhua Yang;Xiaojun Mei;Dezhi Han;Mario D. Marino;Kuan-Ching Li","doi":"10.1109/TNSE.2025.3550566","DOIUrl":null,"url":null,"abstract":"Localization of sensor nodes is a critical issue in Ocean Sensor Networks (OSNs). A key feature of these methods is the use of GPS-enabled mobile beacons that periodically broadcast their locations through path planning to achieve sensor localization. However, mobile beacons in OSNs are vulnerable to wind, waves, and currents, which prevent them from following pre-planned paths. Additionally, existing path planning algorithms are not suitable for handling uncertain obstacles and disturbances in OSN environments. To address these challenges, this article introduces a novel Logic Neural Path Planning (LNPP) scheme for mobile beacons. LNPP incorporates logical rule knowledge into its neural network in order to enhance learning efficiency and reduce unnecessary explorations. Furthermore, to effectively learn strategies across different time scales, a hierarchical reinforcement learning algorithm is proposed. The experimental results demonstrate that, compared to other methods, the proposed path planning scheme reduces the average localization time and the trajectory length by over 21 percent in obstacle-free OSN environments. Moreover, our scheme effectively operates in OSNs with uncertain obstacles.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2606-2621"},"PeriodicalIF":6.7000,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"LNPP: Logical Neural Path Planning of Mobile Beacon for Ocean Sensor Networks in Uncertain Environments Using Hierarchical Reinforcement Learning\",\"authors\":\"Weijun Wang;Huafeng Wu;Shenhua Yang;Xiaojun Mei;Dezhi Han;Mario D. Marino;Kuan-Ching Li\",\"doi\":\"10.1109/TNSE.2025.3550566\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Localization of sensor nodes is a critical issue in Ocean Sensor Networks (OSNs). A key feature of these methods is the use of GPS-enabled mobile beacons that periodically broadcast their locations through path planning to achieve sensor localization. However, mobile beacons in OSNs are vulnerable to wind, waves, and currents, which prevent them from following pre-planned paths. Additionally, existing path planning algorithms are not suitable for handling uncertain obstacles and disturbances in OSN environments. To address these challenges, this article introduces a novel Logic Neural Path Planning (LNPP) scheme for mobile beacons. LNPP incorporates logical rule knowledge into its neural network in order to enhance learning efficiency and reduce unnecessary explorations. Furthermore, to effectively learn strategies across different time scales, a hierarchical reinforcement learning algorithm is proposed. The experimental results demonstrate that, compared to other methods, the proposed path planning scheme reduces the average localization time and the trajectory length by over 21 percent in obstacle-free OSN environments. Moreover, our scheme effectively operates in OSNs with uncertain obstacles.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 4\",\"pages\":\"2606-2621\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-03-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10923749/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10923749/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

传感器节点的定位是海洋传感器网络中的一个关键问题。这些方法的一个关键特点是使用支持gps的移动信标,通过路径规划周期性地广播其位置,以实现传感器定位。但是,osn中的移动信标容易受到风、浪、流的影响,无法按照预先规划的路径运行。此外,现有的路径规划算法不适合处理OSN环境中的不确定障碍物和干扰。为了解决这些挑战,本文介绍了一种新的移动信标逻辑神经路径规划(LNPP)方案。LNPP将逻辑规则知识融入到其神经网络中,以提高学习效率,减少不必要的探索。此外,为了在不同时间尺度上有效地学习策略,提出了一种分层强化学习算法。实验结果表明,与其他路径规划方法相比,所提出的路径规划方案在无障碍OSN环境下的平均定位时间和轨迹长度减少了21%以上。此外,我们的方案在具有不确定障碍的osn中有效地运行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
LNPP: Logical Neural Path Planning of Mobile Beacon for Ocean Sensor Networks in Uncertain Environments Using Hierarchical Reinforcement Learning
Localization of sensor nodes is a critical issue in Ocean Sensor Networks (OSNs). A key feature of these methods is the use of GPS-enabled mobile beacons that periodically broadcast their locations through path planning to achieve sensor localization. However, mobile beacons in OSNs are vulnerable to wind, waves, and currents, which prevent them from following pre-planned paths. Additionally, existing path planning algorithms are not suitable for handling uncertain obstacles and disturbances in OSN environments. To address these challenges, this article introduces a novel Logic Neural Path Planning (LNPP) scheme for mobile beacons. LNPP incorporates logical rule knowledge into its neural network in order to enhance learning efficiency and reduce unnecessary explorations. Furthermore, to effectively learn strategies across different time scales, a hierarchical reinforcement learning algorithm is proposed. The experimental results demonstrate that, compared to other methods, the proposed path planning scheme reduces the average localization time and the trajectory length by over 21 percent in obstacle-free OSN environments. Moreover, our scheme effectively operates in OSNs with uncertain obstacles.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信