Underwater localization is considered a critical technique in the Internet of Underwater Things (IoUTs). However, acquiring accurate location information is challenging due to the heterogeneous underwater environment and the hostile propagation of acoustic signals, especially when using received signal strength (RSS)-based techniques. Additionally, most current solutions rely on strict mathematical expressions, which limits their effectiveness in certain scenarios. To address these challenges, this study develops a quantum-behaved meta-heuristic algorithm, called quantum enhanced Harris hawks optimization (QEHHO), to solve the localization problem without requiring strict mathematical assumptions. The algorithm builds on the original Harris hawks optimization (HHO) by integrating four strategies into various phases to avoid local minima. The initiation phase incorporates good point set theory and quantum computing to enhance the population quality, while a random nonlinear technique is introduced in the transition phase to expand the exploration region in the early stages. A correction mechanism and exploration enhancement combining the slime mold algorithm (SMA) and quasi-oppositional learning (QOL) are further developed to find an optimal solution. Furthermore, the RSS-based Cramér–Raolower bound (CRLB) is derived to evaluate the effectiveness of QEHHO. Simulation results demonstrate the superior performance of QEHHO under various conditions compared to other state-of-the-art closed-form-expression- and meta-heuristic-based solutions.

Decision-making for collision avoidance in complex maritime environments is a critical technology in the field of autonomous ship navigation. However, existing collision avoidance decision algorithms still suffer from unstable strategy exploration and poor compliance with regulations. To address these issues, this paper proposes a novel autonomous ship collision avoidance algorithm, the dynamically adjusted entropy proximal policy optimization (DAE-PPO). Firstly, a reward system suitable for complex maritime encounter scenarios is established, integrating the International Regulations for Preventing Collisions at Sea (COLREGs) with collision risk assessment. Secondly, the exploration mechanism is optimized using a quadratically decreasing entropy method to effectively avoid local optima and enhance strategic performance. Finally, a simulation testing environment based on Unreal Engine 5 (UE5) was developed to conduct experiments and validate the proposed algorithm. Experimental results demonstrate that the DAE-PPO algorithm exhibits significant improvements in efficiency, success rate, and stability in collision avoidance tests. Specifically, it shows a 45% improvement in success rate per hundred collision avoidance attempts compared to the classic PPO algorithm and a reduction of 0.35 in the maximum collision risk (CR) value during individual collision avoidance tasks.

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.