In ship navigation, determining a safe and economic path from start to destination under dynamic and complex environment is essential, but the traditional algorithms of current research are inefficient. Therefore, a novel differential evolution deep reinforcement learning algorithm (DEDRL) is proposed to address problems, which are composed of local path planning and global path planning. The Deep Q-Network is utilized to search the best path in target ship and multiple-obstacles scenarios. Furthermore, differential evolution and course-punishing reward mechanism are introduced to optimize and constrain the detected path length as short as possible. Quaternion ship domain and COLREGs are involved to construct a dynamic collision risk detection model. Compared with other traditional and reinforcement learning algorithms, the experimental results demonstrate that the DEDRL algorithm achieved the best global path length with 28.4539 n miles, and also performed the best results in all scenarios of local path planning. Overall, the DEDRL algorithm is a reliable and robust algorithm for ship navigation, and it also provides an efficient solution for ship collision avoidance.
Accurate ship trajectory prediction is vital for intelligent maritime traffic management, yet conventional hybrid models often fail to balance local feature extraction, long-term dependency capture, and flexible feature weighting when processing AIS data. This paper proposes an MSC-BiLSTM-ATTENTION model that integrates trajectory clustering and an adaptive attention mechanism into a unified framework. Its fundamental advance over existing incremental hybrid architectures is twofold. First, a K-means clustering step groups trajectories with similar motion patterns before model training, effectively reducing the impact of data heterogeneity on prediction accuracy. Second, the deep learning backbone synergizes multi-scale convolution (MSC)—which captures local features at multiple temporal granularities via parallel kernels—with a bidirectional LSTM (BiLSTM) for forward–backward dependency learning, and an adaptive self-attention mechanism that dynamically optimizes feature weights to amplify critical navigation information. Extensive experiments on AIS data from the Gulf of Mexico and the U.S. Atlantic Coast, covering four seasons, benchmark the model against attention-enhanced architectures including Transformer, CNN-BiLSTM-ATTENTION, and DenseNet-BiGRU-ATTENTION across two distinct regions. The proposed model achieves significant improvements in predicting longitude, latitude, speed over ground, and course over ground, reducing MAE by over 76.9% and RMSE by over 65.3% compared with the strongest baseline. Ablation studies confirm that the synergy of all three modules is essential. The results demonstrate the model’s effectiveness and its practical value for intelligent maritime supervision, navigation risk warning, and waterborne traffic management.
With the high degree of integration of production capacity in the industrial field, the original form of single, linear, and vertical cooperation between different industrial chains has been broken, and a multiplex networked industrial chain has been formed. Traditional time series forecasting methods are often prone to fall into the trap of computational volume caused by long historical information and the problem of dimensional explosion caused by the mixing of redundant information in the face of multiple networked industrial chain capacity forecasting with large data volume and high information dimensionality. In this paper, we first propose an information decoupling technique based on the principle of time series decomposition to provide more accurate cyclical forecasting results for capacity forecasting. Secondly, this paper introduces a multi-scale dynamic aggregation network technique. This technique dynamically aggregates and predicts variables at different time scales. The combination of these two approaches is adept at capturing a wider range of local and global trends, thereby greatly improving the accuracy and robustness of forecasting models. In this paper, experiments are conducted to compare with the current mainstream time series prediction algorithms. The results show that in multivariate long time series, the error of our algorithm is reduced by 27.8%.
Multirobot information gathering in adversarial environments, where enemies can destroy detected robots, presents unique challenges not addressed by existing algorithms designed for safe settings. The advent of multirobot systems enables collaborative risk-avoidance behavior, exemplified in pursuit-evasion scenarios, where concentrated robot groups enhance their ability to evade and overcome pursuing enemies. However, current multirobot information gathering algorithms have not yet integrated this collaborative risk-avoidance model, potentially leading to robot damage and reduced efficiency. This study adopts a decomposition-andgrafting mechanism to separate the problem into two weakly coupled subproblems: task execution and task allocation. For task execution, we propose an exact algorithm based on the branch-and-pricing method. Our task execution algorithms are seamlessly integrated with a novel task map composition algorithm designed to identify high-utility solutions with minimal computational overhead, addressing the task allocation problem. Extensive simulations demonstrate that our algorithms significantly outperform benchmarks by increasing the number of collaborative risk-avoidance activities conducted by robots during information gathering tasks in adversarial environments. This research advances multirobot information gathering by incorporating collaborative risk-avoidance, enhancing robot survivability and efficiency in hazardous settings.